We propose an innovative, integrated solution to path planning, path following, and obstacle avoidance that is suitable both for 2D and 3D navigation. The proposed method takes as input a generic curve connecting a start and a goal position, and is able to find a corresponding path from start to goal in a maze-like environment even in the absence of global information, it guarantees convergence to the path with kinematic control, and finally avoids locally sensed obstacles without becoming trapped in deadlocks. This is achieved by computing a closed-form expression in which the control variables are a continuous function of the input curve, the robot’s state, and the distance of all the locally sensed obstacles. Specifically, we introduce a novel formalism for describing the path in two and three dimensions, as well as a computationally efficient method for path deformation (based only on local sensor readings) that is able to find a path to the goal even when such path cannot be produced through continuous deformations of the original. The article provides formal proofs of all the properties above, as well as simulated results in a simulated environment with a wheeled robot, an underwater vehicle, and a multicopter.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Integrated robot planning, path following, and obstacle avoidance in two and three dimensions: Wheeled robots, underwater vehicles, and multicopters|
|Data di pubblicazione:||2019|
|Appare nelle tipologie:||01.01 - Articolo su rivista|