Mobile robots have been used for various purposes with different functionalities which require them to freely move in environments containing both static and dynamic obstacles to accomplish given tasks. One of the most relevant capabilities in terms of navigating a mobile robot in such an environment is to find a safe path to a goal position. This paper shows that there exists an accurate solution to the Laplace equation which allows finding a collision-free path and that it can be efficiently calculated for a rectangular bounded domain such as a map which is represented as an image. This is accomplished by the use of the monogenic scale space resulting in a vector field which describes the attracting and repelling forces from the obstacles and the goal. The method is shown to work in reasonably convex domains and by the use of tessellation of the environment map for non-convex environments. ; Funding agencies:This work was founded by the European Union's Horizon 2020 Programme under grant agreement 644839 (CEN-TAURO).
Computing a Collision-Free Path using the monogenic scale space
2018-01-01
Conference paper
Electronic Resource
English
DDC: | 629 |
The Monogenic Scale Space on a Rectangular Domain and its Features
British Library Online Contents | 2005
|The Monogenic Scale-Space A Unifying Approach to Phase-Based Image Processing in Scale-Space
British Library Online Contents | 2004
|Wiley | 2021
|METHOD OF GENERATING A COLLISION FREE PATH OF TRAVEL AND COMPUTING SYSTEM
European Patent Office | 2022
|Method of generating a collision free path of travel and computing system
European Patent Office | 2022
|