Heuristic Search for Path Finding With Refuelling

This letter considers a generalization of the Path Finding (PF) problem with refuelling constraints referred to as the Gas Station Problem (GSP). Similar to PF, given a graph where vertices are gas stations with known fuel prices, and edge costs are the gas consumption between the two vertices, GSPs...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE robotics and automation letters Jg. 10; H. 4; S. 3230 - 3237
Hauptverfasser:	Zhao, Shizhe, Nandy, Anushtup, Choset, Howie, Rathinam, Sivakumar, Ren, Zhongqiang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.04.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Apexes Autonomous aerial vehicles Costs Dynamic programming Fuels Graph theory Heuristic Mathematical programming Motion and path planning Motion planning Path planning Polynomials Refueling Robot kinematics robotics in under-resourced settings Runtime scheduling and coordination Search algorithms Service stations Training Urban areas
ISSN:	2377-3766, 2377-3766
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!