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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE robotics and automation letters Ročník 10; číslo 4; s. 3230 - 3237
Hlavní autoři:	Zhao, Shizhe, Nandy, Anushtup, Choset, Howie, Rathinam, Sivakumar, Ren, Zhongqiang
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 01.04.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!