A novel LAPN algorithm based path navigation approach for autonomous agents

Abstract This paper discusses multi-agent path navigation in unknown environments. It is a challenging task to design an effective communication-based algorithm with minimal error, which would ensure secure navigation of multi-agent paths under complex circumstances, reduce the length of the travelled path, and minimize the runtime. A leader agent path navigation (LAPN) algorithm is proposed in this paper for multi-agent communication. The obstacle avoidance mechanism is used in the first part of the algorithm. The execution time of the algorithm is influenced by the process of leader-to-follower path update, since the updating process determines how quickly the followers receive corrected trajectories. One leader and two follower agents were considered in simulation environments to establish the feasibility of the algorithm. The LAPN algorithm achieves an average percentage deviation, calculated as the relative difference from the ideal straight-line path of 2.82% in travel time and 31% in path length, showing satisfactory navigation efficiency under obstacle-constrained conditions.

Authors

Institutions

Publication Details

Journal
Control and Cybernetics
Published
2025-06-01
DOI
https://doi.org/10.2478/candc-2025-0008
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

A novel LAPN algorithm based path navigation approach for autonomous agents

Subhradip Mukherjee
Control and Cybernetics
Robotic Path Planning Algorithms
article

A novel LAPN algorithm based path navigation approach for autonomous agents

Subhradip Mukherjee
article en

Abstract

Abstract This paper discusses multi-agent path navigation in unknown environments. It is a challenging task to design an effective communication-based algorithm with minimal error, which would ensure secure navigation of multi-agent paths under complex circumstances, reduce the length of the travelled path, and minimize the runtime. A leader agent path navigation (LAPN) algorithm is proposed in this paper for multi-agent communication. The obstacle avoidance mechanism is used in the first part of the algorithm. The execution time of the algorithm is influenced by the process of leader-to-follower path update, since the updating process determines how quickly the followers receive corrected trajectories. One leader and two follower agents were considered in simulation environments to establish the feasibility of the algorithm. The LAPN algorithm achieves an average percentage deviation, calculated as the relative difference from the ideal straight-line path of 2.82% in travel time and 31% in path length, showing satisfactory navigation efficiency under obstacle-constrained conditions.

Control and CyberneticsVol. 54(2)
MVJ Medical College and Research Hospital (IN)
Openalex Percentile: Top 37%
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.

A novel LAPN algorithm based path navigation approach for autonomous agents — Subhradip Mukherjee · Control and Cybernetics (2025) | TGRS Research Map | TGRS