A globally converging algorithm for reactive robot navigation among moving and deforming obstacles
From MaRDI portal
Publication:490842
DOI10.1016/j.automatica.2015.02.012zbMath1318.93065OpenAlexW2051270683WikidataQ58883577 ScholiaQ58883577MaRDI QIDQ490842
Michael Colin Hoy, Savkin, Andrey V., Alexey S. Matveev
Publication date: 21 August 2015
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2015.02.012
Automated systems (robots, etc.) in control theory (93C85) Artificial intelligence for robotics (68T40)
Related Items (2)
The Convex Feasible Set Algorithm for Real Time Optimization in Motion Planning ⋮ Safe polyhedral tubes for locally convexified MPC
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A method for reactive navigation of nonholonomic under-actuated robots in maze-like environments
- Robotics, vision and control. Fundamental algorithms in MATLAB.
- A method for guidance and control of an autonomous vehicle in problems of border patrolling and obstacle avoidance
- On multiple moving objects
- Reactive visual navigation based on omnidirectional sensing -- path following and collision avoidance
- Optimization and nonsmooth analysis
- Motion planning in the presence of moving obstacles
- Planning Algorithms
This page was built for publication: A globally converging algorithm for reactive robot navigation among moving and deforming obstacles