Sciweavers

332 search results - page 54 / 67
» Traveling salesman path problems
Sort
View
ATAL
2008
Springer
13 years 9 months ago
A new approach to cooperative pathfinding
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map...
M. Renee Jansen, Nathan R. Sturtevant
CEC
2010
IEEE
12 years 11 months ago
A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 8 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
CDC
2009
IEEE
148views Control Systems» more  CDC 2009»
13 years 12 months ago
An adaptive artificial potential function approach for geometric sensing
In this paper, a novel artificial potential function is proposed for planning the path of a robotic sensor in a partially observed environment containing multiple obstacles and mul...
Guoxian Zhang, Silvia Ferrari
CEC
2005
IEEE
14 years 1 months ago
A quantitative approach for validating the building-block hypothesis
The building blocks are common structures of high-quality solutions. Genetic algorithms often assume the building-block hypothesis. It is hypothesized that the high-quality solutio...
Chatchawit Aporntewan, Prabhas Chongstitvatana