Design of Robot Path Planning Algorithm Based on ROS

The current military adversarial intelligent robots have received unprecedented attention and development. Research on fully automatic robots capable of completing specific adversarial tasks has significant practical value, and the autonomous navigation of adversarial robots in the environment is one of the most pressing issues to be addressed. This paper, based on the ROS (Robot Operating System) robot development platform, presents a path planning algorithm for robot pathfinding. Firstly, this paper derives the A* search algorithm used for global navigation and improves it according to cost maps tailored for adversarial tasks. Subsequently, this paper investigates the TEB (Timed-Elastic-Band) algorithm for local navigation and obstacle avoidance, optimizing multiple objective functions through multi-objective optimization to achieve dynamic flexible obstacle avoidance while closely adhering to paths provided by global navigation. Finally, this paper conducts coordination and testing of the robot's automatic navigation function in a simulated environment.

Authors

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icus61736.2024.10839989
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Design of Robot Path Planning Algorithm Based on ROS

Yuanyuan Wang, Xiangfeng Ma, Z M Jin
Robotic Path Planning Algorithms
article

Design of Robot Path Planning Algorithm Based on ROS

Yuanyuan Wang, Xiangfeng Ma, Z M Jin
article en

Abstract

The current military adversarial intelligent robots have received unprecedented attention and development. Research on fully automatic robots capable of completing specific adversarial tasks has significant practical value, and the autonomous navigation of adversarial robots in the environment is one of the most pressing issues to be addressed. This paper, based on the ROS (Robot Operating System) robot development platform, presents a path planning algorithm for robot pathfinding. Firstly, this paper derives the A* search algorithm used for global navigation and improves it according to cost maps tailored for adversarial tasks. Subsequently, this paper investigates the TEB (Timed-Elastic-Band) algorithm for local navigation and obstacle avoidance, optimizing multiple objective functions through multi-objective optimization to achieve dynamic flexible obstacle avoidance while closely adhering to paths provided by global navigation. Finally, this paper conducts coordination and testing of the robot's automatic navigation function in a simulated environment.

Sustainable cities and communities
Openalex Percentile: Top 74%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.