Stochastic Artificial Potentials for Online Safe Navigation

  title={Stochastic Artificial Potentials for Online Safe Navigation},
  author={Santiago Paternain and Alejandro Ribeiro},
  journal={IEEE Transactions on Automatic Control},
Consider a convex set of which we remove an arbitrary number of disjoints convex sets—the obstacles—and a convex function whose minimum is the agent's goal. We consider a local and stochastic approximation of the gradient of a Rimon–Koditschek navigation function where the attractive potential is the convex function that the agent is minimizing. In particular, we show that if the estimate available to the agent is unbiased, convergence to the desired location while avoiding the obstacles is… 

Figures from this paper

A Newton Method for Faster Navigation in Cluttered Environments

A second-order method is proposed that pre-multiplies the gradient by a modified Hessian to account for the curvature of the function and is shown to escape saddles exponentially with base 3/2 independently of the condition number of the Hessian.

Sensor-based reactive navigation in unknown convex sphere worlds

A sensor-based feedback law is constructed that provably solves the real-time collision-free robot navigation problem in a compact convex Euclidean subset cluttered with unknown but sufficiently separated and strongly convex obstacles and extended to practically motivated limited range, isotropic and anisotropic sensing models, and the standard differential-drive vehicle.

Navigation of a Quadratic Potential with Ellipsoidal Obstacles

A modification to gradient dynamics is proposed that allows successful navigation of an environment with a quadratic cost and ellipsoidal obstacles regardless of their eccentricity, intended to imitate worlds with spherical obstacles in which Rimon-Koditschek potentials are known to work.

Navigation of a Quadratic Potential with Star Obstacles

This work closes the gap between local information and global information by extending convergence guarantees with local information to star worlds in general and establishes convergence to the goal and obstacle avoidance from every initial position in the free space.

Robust Obstacle Avoidance via Vision-Based Hybrid Learning Control

  • Mathematics
  • 2021
We study the problem of target stabilization with robust obstacle avoid1 ance in robots and vehicles that have access to vision-based sensors generating 2 streams of complex nonlinear data. This

Connectivity Preserving Formation Stabilization in an Obstacle-Cluttered Environment in the Presence of Time-Varying Communication Delays

This technical article addresses the formation stabilization problem for multiagent systems (MASs) composed of dynamical agents moving within an obstacle-cluttered environment and sharing information

Robust Coordinated Hybrid Source Seeking With Obstacle Avoidance in Multivehicle Autonomous Systems

A class of novel distributed hybrid model-free adaptive controllers that achieve robust source seeking and obstacle avoidance in multi-vehicle autonomous systems with general nonlinear dynamics stabilizable by hybrid feedback are introduced.

Data-Assisted Vision-Based Hybrid Control for Robust Stabilization with Obstacle Avoidance via Learning of Perception Maps

We study the problem of target stabilization with robust obstacle avoidance in robots and vehicles that have access only to vision-based sensors for the purpose of real-time localization. This

Stochastic Control Foundations of Autonomous Behavior

STOCHASTIC CONTROL FOUNDations of AUTONOMOUS BEHAVIOR: Foundations of autonomous vehicle control systems and their applications in robotics and smart grids.

Source Seeking in Unknown Environments with Convex Obstacles

This work constructs an artificial potential over which an exact gradient dynamics would generate a collision-free trajectory to the target in a world with convex obstacles and proves that the proposed solution not only finds the source, but does so while avoiding any obstacle.



Navigation Functions for Convex Potentials in a Space With Convex Obstacles

This paper derives conditions that guarantee artificial potentials to have a single minimum that is arbitrarily close to the minimum of the natural potential.

Navigation functions for focally admissible surfaces

This work presents a sharper condition for the applicability of Navigation Functions (NF) and establishes a link between the differential geometry of obstacle surfaces and KRNFs, with some notes about allowable types of non-smoothness.

The construction of analytic diffeomorphisms for exact robot navigation on star worlds

  • E. RimonD. Koditschek
  • Mathematics
    Proceedings, 1989 International Conference on Robotics and Automation
  • 1989
A general methodology is described which extends the construction of navigation functions on sphere worlds to any smoothly deformable space and yields automatically a bounded torque feedback control law which is guaranteed to guide the robot to destination point from almost every initial position without hitting any obstacle.

Exact robot navigation using artificial potential functions

A methodology for exact robot motion planning and control that unifies the purely kinematic path planning problem with the lower level feedback controller design is presented. Complete information

Navigation Functions for everywhere partially sufficiently curved worlds

This work extends Navigation Functions (NF) to worlds of more general geometry and topology by direct definition in the geometrically complicated configuration space, without the need for diffeomorphisms, and establishes the existence of appropriate tuning for this purpose.

Robot navigation functions on manifolds with boundary

Nonconvergence to Unstable Points in Urn Models and Stochastic Approximations

A particle in Rd moves in discrete time. The size of the nth step is of order 1/n and when the particle is at a position v the expectation of the next step is in the direction F(v) for some fixed

Global path planning using artificial potential fields

  • C. W. Warren
  • Business
    Proceedings, 1989 International Conference on Robotics and Automation
  • 1989
By considering the entire path, the problem of being trapped in a local minimum is greatly reduced, allowing the method to be used for global planning, and was tried with success on many different realistic planning problems.

Toward dynamical sensor management for reactive wall-following

It is proved that in any neighborhood within which the third-order infinitesimal data accurately predicts the local “shape” of the wall, neither robot will ever hit it.

Navigation functions in topologically complex 3-D workspaces

  • S. Loizou
  • Mathematics, Computer Science
    2012 American Control Conference (ACC)
  • 2012
This paper proposes the first provably correct construction of Navigation Functions in 3D workspaces that are topologically complex, using an extension of the recently introduced Navigation Transformation that can handle any workspace and obstacle topology that can be categorized under the Classification Theorem of orientable 2-manifolds.