Real-time obstacle avoidance for manipulators and mobile robots
International Journal of Robotics Research
The complexity of robot motion planning
The complexity of robot motion planning
Computational Geometry: Theory and Applications
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Modern control theory (3rd ed.)
Modern control theory (3rd ed.)
Robot motion planning: a distributed representation approach
International Journal of Robotics Research
Algorithmic algebra
Analog VLSI for robot path planning
Journal of VLSI Signal Processing Systems - Joint special issue on Analog VLSI computation; also see Analog Integrated Circuits Signal Process., Vol. 6, No. 1
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Sensor-based potential panel method for robot motion planning
Sensor-based potential panel method for robot motion planning
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Computational real algebraic geometry
Handbook of discrete and computational geometry
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Linear System Theory and Design
Linear System Theory and Design
Robot Motion Planning
Introduction to Hybrid Dynamical Systems
Introduction to Hybrid Dynamical Systems
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Fast Triangulation of Simple Polygons
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
SIAM Journal on Numerical Analysis
Representing spatial experience and solving spatial problems in a simulated robot environment
Representing spatial experience and solving spatial problems in a simulated robot environment
Navigation of an autonomous vehicle using a combined electrostatic potential field/fuzzy inference approach
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Planning Algorithms
Complexity of the mover's problem and generalizations
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Reachability analysis of multi-affine systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
A convergent dynamic window approach to obstacle avoidance
IEEE Transactions on Robotics
Discrete abstractions for robot motion planning and control in polygonal environments
IEEE Transactions on Robotics
Mobile robot navigation in 2-D dynamic environments using an electrostatic potential field
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Constrained motion control using vector potential fields
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Control of systems integrating logic, dynamics, and constraints
Automatica (Journal of IFAC)
A control problem for affine dynamical systems on a full-dimensional polytope
Automatica (Journal of IFAC)
Exploration of 2D and 3D Environments using Voronoi Transform and Fast Marching Method
Journal of Intelligent and Robotic Systems
Global vector field computation for feedback motion planning
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Research paper: Sampling-based robot motion planning: Towards realistic applications
Computer Science Review
A hierarchical approach for primitive-based motion planning and control of autonomous vehicles
Robotics and Autonomous Systems
Hi-index | 0.00 |
This paper presents a novel approach to computing feedback laws in the presence of obstacles. Instead of computing a trajectory between a pair of initial and goal states, our algorithms compute a vector field over the entire state space; all trajectories obtained from following this vector field are guaranteed to asymptotically reach the goal state. As a result, the vector field globally solves the navigation problem and provides robustness to disturbances in sensing and control. The vector field's integral curves (system trajectories) are guaranteed to avoid obstacles and are C∞ smooth. We construct a vector field with these properties by partitioning the space into simple cells, defining local vector fields for each cell, and smoothly interpolating between them to obtain a global vector field. We present an algorithm that computes these feedback controls for a kinematic point robot in an arbitrary dimensional space with piecewise linear boundary; the algorithm requires minimal preprocessing of the environment and is extremely fast during execution. For many practical applications in two-dimensional environments, full computation can be done in milliseconds. We also present an algorithm for computing feedback laws over cylindrical algebraic decompositions, thereby solving a smooth feedback version of the generalized piano movers' problem.