A search algorithm optimization path planning in mobile robots scenarios

Path planning for mobile robotics in unknown environments or with moving obstacles requires re-planning paths based on information gathered from the surroundings. Moving obstacles and real time constraints require fast computing to navigate and make decisions in a mobile robot. This paper addresses...

Full description

Saved in:
Bibliographic Details
Published inAIP conference proceedings Vol. 2116; no. 1
Main Authors Lima, José, Costa, Pedro, Costa, Paulo, Eckert, Lucas, Piardi, Luis, Moreira, A. Paulo, Nakano, Alberto
Format Journal Article Conference Proceeding
LanguageEnglish
Published Melville American Institute of Physics 24.07.2019
Subjects
Moving obstacles
Optimization
Path planning
Real time
Robotics
Robots
Search algorithms
Unknown environments
Online AccessGet full text
ISSN0094-243X
1551-7616
DOI10.1063/1.5114223

Cover

More Information
Summary:Path planning for mobile robotics in unknown environments or with moving obstacles requires re-planning paths based on information gathered from the surroundings. Moving obstacles and real time constraints require fast computing to navigate and make decisions in a mobile robot. This paper addresses an optimization approach to compute, with real time constraints, the optimal path for a mobile robot based on a dynamically simplified A* search algorithm with a commitment on the available time.
Bibliography:ObjectType-Conference Proceeding-1
SourceType-Conference Papers & Proceedings-1
content type line 21
ISSN:0094-243X
1551-7616
DOI:10.1063/1.5114223