Enhanced Shortest Path Computation for Multiagent-based Intermodal Transport Planning in Dynamic Environments.
Christoph GreulichStefan EdelkampMax GathTobias WardenMalte HumannOtthein HerzogT. G. SitharamPublished in: ICAART (2) (2013)
Keyphrases
- dynamic environments
- shortest path
- collision free
- transport network
- travel time
- belief space
- shortest path problem
- routing problem
- plan execution
- mobile robot
- routing algorithm
- single agent
- autonomous agents
- shortest path algorithm
- road network
- spatial networks
- path planning
- optimal path
- path length
- path selection
- agent systems
- changing environment
- weighted graph
- potential field
- motion planning
- path queries
- shortest distance
- planning problems
- collision avoidance
- multiple objectives
- public transport
- finding the shortest path