SP2E: Online Spiral Coverage with Proactive Prevention Extremum for Unknown Environments

Coverage path planning (CPP) is the foundation of multiple robotic applications. The efficiency of CPP is affected by the local extremum, which describes a situation with the robot surrounded by obstacles and explored areas, even if unexplored areas remain in the environment. Most online CPP methods...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of intelligent & robotic systems 2023-06, Vol.108 (2), p.30, Article 30
Hauptverfasser: Li, Lin, Shi, Dianxi, Jin, Songchang, Yang, Shaowu, Lian, Yaoning, Liu, Hengzhu
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Coverage path planning (CPP) is the foundation of multiple robotic applications. The efficiency of CPP is affected by the local extremum, which describes a situation with the robot surrounded by obstacles and explored areas, even if unexplored areas remain in the environment. Most online CPP methods reactively deal with the local extremum after the mobile robot is trapped within it. However, repeated coverage is generated since the path of escaping the local extremum revisits the covered areas. This paper presents an online spiral coverage framework with proactive prevention of extremum (SP2E) to address the CPP problem in an unknown environment. Unlike other CPP methods, the SP2E approach prevents the local extremum through a cut vertex detection algorithm and a direction adaptation algorithm. The cut vertex detection algorithm predicts the local extremum by detecting cut vertexes, and the direction adaptation algorithm prevents it by adjusting the spiral path’s direction. The SP2E approach was validated by simulations and real-world experiments, and its performance was compared with other CPP algorithms. The results of simulations and real-world experiments demonstrate that the SP2E approach provides the minimum coverage time and computation time while avoiding the local extremum.
ISSN:0921-0296
1573-0409
DOI:10.1007/s10846-023-01844-z