Modified adaptive ant colony optimization algorithm and its application for solving path planning of mobile robot

Wu, Lei; Huang, Xiaodong; Cui, Junguo; Liu, Chao; Xiao, Wensheng

doi:10.1016/j.eswa.2022.119410

Cited by 130 publications

(35 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The existing path planning methods can be divided into global path planning [26] and local path planning [27] . Commonly used algorithms include ant colony algorithm [28] , A* algorithm [29] , random number algorithm [30] and greedy algorithm, etc. In this paper, five evaluation indexes that are more important in the medical environment are used as the scoring criteria for the algorithm radar map.…”

Section: Selection Of Path Planning Algorithmmentioning

confidence: 99%

Research on dynamic and static obstacle avoidance strategy and path planning of medical AGV based on the bionic characteristics of antelope migration

Hu,

Niu,

Gao

et al. 2024

Preprint

View full text Add to dashboard Cite

Aiming at the problem that Automated guided vehicle (AGV) faces dynamic and static obstacles in the process of transporting patients in medical environment and needs to avoid in real time, inspired by the behavior of antelopes during migration, this paper proposes a bionic obstacle avoidance strategy based on adaptive behavior of antelopes. The artificial potential field and dynamic window algorithm are improved by using the decircling strategy and conical visual distance during antelope migration. The limitations of traditional artificial potential field algorithm are improved by adding new potential field force points into the global planning, and the real-time obstacle avoidance ability of medical AGV is enhanced. The evaluation index of the algorithm is improved in local path planning, and the prediction range of AGV navigation is enlarged. Simulation experiments were carried out through the numerical simulation platform, and the verification results showed that:The bionic obstacle avoidance strategy proposed in this paper can avoid dynamic and static obstacles at the same time. In the example, the success rate of path planning is increased by 34%, the running time is reduced by 33%, and the average path length is reduced by 1%. The proposed method can realize the integration of "dynamic and static" avoidance in the process of transporting patients, and effectively save the time of transporting patients by AGV.It provides a theoretical basis for realizing obstacle avoidance and rapid loading of AGV in medical environment.

show abstract

Section: Selection Of Path Planning Algorithmmentioning

confidence: 99%

Research on dynamic and static obstacle avoidance strategy and path planning of medical AGV based on the bionic characteristics of antelope migration

Hu,

Niu,

Gao

et al. 2024

Preprint

View full text Add to dashboard Cite

show abstract

“…Path planning is one of the essential issues of the robots industry [23]. Since the path planning problem is of NPhardness [24], it is hard for an exponentially complicated traverse algorithm to satisfy the time-limited practical applications.…”

Section: Related Workmentioning

confidence: 99%

Joint Task Allocation and Path Planning for Space Robot

Sun

Liu

2023

IEEE Access

View full text Add to dashboard Cite

Space robots have a broad application prospect in the aerospace industry. It is difficult for space robots to keep running for a long time due to limited fuel. In addition, it is impossible to replenish the fuel for space robots at any time due to the unique working environment. Therefore, a proper path is crucial for the effective operation of the space robot. In this paper, we investigate the allocation of exploration tasks and the path planning of space robots jointly. The goal is to minimize the completion latency of exploration tasks. We propose two algorithms named subbranch insertion task allocation (SI-TA) and parallel search task allocation (PS-TA) to solve the problem. We also customize an algorithm named random path planning task allocation (RTA) as the baseline. At last, we implement extensive experiments to demonstrate that proposed algorithms can obtain lower completion latency than RTA. Compared with RTA, the proposed algorithms SI-TA and PS-TA can reduce completion latency by at least 20% and 40%, respectively. Moreover, both algorithms work more stably than RTA.

show abstract

“…This mechanism allows for the real-time updating of states during the process of path changes, thereby avoiding traffic congestion [7] . The information mechanism equation is as follows (equations 3) [8][9][10][11][12][13] :…”

Section: Improved Local Information Updating Mechanismmentioning

confidence: 99%

Path Planning for Road Congestion Problems Based on the A* Algorithm

Xuan,

Ding

2023

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

The application of path planning serves as a significant instance of intelligent algorithm technology innovation, integrating intelligent science, smart technologies, and industrialization. Its core capability lies in achieving optimal solutions for routes through algorithms, offering people improved navigation paths. Currently, path planning technology has become a focal point of research both domestically and internationally. This paper proposes enhancements to the A* algorithm. By incorporating a heuristic function, the A* algorithm efficiently improves its computational effectiveness, thereby furnishing users with enhanced route planning. In this work, the improved A* algorithm is employed to address issues of road congestion and path planning. Through refining the storage heap structure of the A* algorithm and optimizing Hash table indexing, preprocessing of traffic environment data is performed. Subsequently, data simulation is executed. Based on simulation experiment data and preprocessing of road conditions, the results demonstrate that the enhanced A* algorithm offers accurate information.

show abstract

Modified adaptive ant colony optimization algorithm and its application for solving path planning of mobile robot

Cited by 130 publications

References 45 publications

Research on dynamic and static obstacle avoidance strategy and path planning of medical AGV based on the bionic characteristics of antelope migration

Research on dynamic and static obstacle avoidance strategy and path planning of medical AGV based on the bionic characteristics of antelope migration

Joint Task Allocation and Path Planning for Space Robot

Path Planning for Road Congestion Problems Based on the A* Algorithm

Contact Info

Product

Resources

About