Introduction to Mobile Robot Path Planning

Koubâa, Anis; Bennaceur, Hachémi; Châari, Imen; Trigui, Sahar; Ammar, Adel; Sriti, Mohamed–Foued; Alajlan, Maram; Cheikhrouhou, Omar; Javed, Yasir

doi:10.1007/978-3-319-77042-0_1

Cited by 24 publications

(9 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem of multi-robot path planning is still extremely difficult due to its high difficulty and the existence of hard non-deterministic polynomial-time problems [75]. Figure 5 shows the path planning categories [76]. The path planning problem in a multi-robot system is challenging, because finding the best collision-free paths are affected by dynamically changing environments due to the robots' movement [77].…”

Section: The Challenges Of Multi-robot Systemsmentioning

confidence: 99%

A review of multi-agent mobile robot systems applications

Rasheed

Abdullah

Al-Araji

2022

IJECE

View full text Add to dashboard Cite

<span>A multi-agent robot system (MARS) is one of the most important topics nowadays. The basic task of this system is based on distributive and cooperative work among agents (robots). It combines two important systems; multi-agent system (MAS) and multi-robots system (MRS). MARS has been used in many applications such as navigation, path planning detection systems, negotiation protocol, and cooperative control. Despite the wide applicability, many challenges still need to be solved in this system such as the communication links among agents, obstacle detection, power consumption, and collision avoidance. In this paper, a survey of the motivations, contributions, and limitations for the researchers in the MARS field is presented and illustrated. Therefore, this paper aims at introducing new study directions in the field of MARS.</span>

show abstract

Section: The Challenges Of Multi-robot Systemsmentioning

confidence: 99%

A review of multi-agent mobile robot systems applications

Rasheed

Abdullah

Al-Araji

2022

IJECE

View full text Add to dashboard Cite

show abstract

“…Usually, the obstacle avoidance term is used with unknown environment, which is mean the robots move in the free space without any collision with the environment's obstacles [5]. Due to the different purposes and functions of the same functional robot as shown in Figure 2, many problems must be considered in planning the path of a mobile robot [6]. While moving obstacles, the issues of path planning is a practical one, as the robot is permitted to move the obstacles if it blocks a robot path from the start of the target position [7].…”

Section: Figure 1: Mobile Robot Problemmentioning

confidence: 99%

A Review on Path Planning Algorithms for Mobile Robots

Abed¹,

Lutfy²,

Al-Doori³

2021

ETJ

View full text Add to dashboard Cite

Mobile robots use is rising every day. Path planning algorithms are needed to make a traveler of robots with the least cost and without collisions. Many techniques have been developed in path planning for mobile robot worldwide, however, the most commonly used techniques are presented here for further study. This essay aims to review various path planning strategies for mobile robots using different optimization methods taken recent publisher’s paper in last five year.

show abstract

“…The problem of path planning becomes even more critical when both targets and obstacles are moving because they must react immediately and effectively to the movements of the goal and the obstacles. Generally, PP in the dynamic environments encompasses was further complicated compared to that in the static environments because of the environment's uncertainty [10]. This environment's complexity results from the number of the moving obstacles [11].…”

Section: Introductionmentioning

confidence: 99%

Hybrid metaheuristic approach for robot path planning in dynamic environment

Amar

Jasim

2021

Bulletin EEI

View full text Add to dashboard Cite

Recently robots have gained great attention due to their ability to operate in dynamic and complex environments with moving obstacles. The path planning of a moving robot in a dynamic environment is to find the shortest and safe possible path from the starting point towards the desired target point. A dynamic environment is a robot's environment that consists of some static and moving obstacles. Therefore, this problem can be considered as an optimization problem and thus it is solved via optimization algorithms. In this paper, three approaches for determining the optimal pathway of a robot in a dynamic environment were proposed. These approaches are; the particle swarming optimization (PSO), ant colony optimization (ACO), and hybrid PSO and ACO. These used to carry out the path planning tasks effectively. A set of certain constraints must be met simultaneously to achieve the goals; the shortest path, the least time, and free from collisions. The results are calculated for the two algorithms separately and then that of the hybrid algorithm is calculated. The effectiveness and superiority of the hybrid algorithm were verified on both PSO and ACO algorithms.

show abstract

Introduction to Mobile Robot Path Planning

Cited by 24 publications

References 18 publications

A review of multi-agent mobile robot systems applications

A review of multi-agent mobile robot systems applications

A Review on Path Planning Algorithms for Mobile Robots

Hybrid metaheuristic approach for robot path planning in dynamic environment

Contact Info

Product

Resources

About