Towards Routing in Robotics: Using Constraint Programming in Anytime Path Planner

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F11%3A00192632" target="_blank" >RIV/68407700:21340/11:00192632 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Towards Routing in Robotics: Using Constraint Programming in Anytime Path Planner
Popis výsledku v původním jazyce
Path planning is one of the critical tasks for autonomous robots. We will study the problem of finding the shortest path for a robot collecting waste spread over the area such that the robot has a limited capacity and hence during the route it must periodically visit depots/collectors to empty the collected waste. This is a variant of often overlooked vehicle routing problem with satellite facilities. We present the approach based on Constraint Programming techniques driven by the concept of finite state automaton. The experimental comparison and enhancements of models are discussed.
Název v anglickém jazyce
Towards Routing in Robotics: Using Constraint Programming in Anytime Path Planner
Popis výsledku anglicky
Path planning is one of the critical tasks for autonomous robots. We will study the problem of finding the shortest path for a robot collecting waste spread over the area such that the robot has a limited capacity and hence during the route it must periodically visit depots/collectors to empty the collected waste. This is a variant of often overlooked vehicle routing problem with satellite facilities. We present the approach based on Constraint Programming techniques driven by the concept of finite state automaton. The experimental comparison and enhancements of models are discussed.

Rok uplatnění
2011
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)