Sciweavers

2 search results - page 1 / 1
» Divide and Conquer in Multi-Agent Planning
Sort
View
AAAI
1994
13 years 6 months ago
Divide and Conquer in Multi-Agent Planning
Eithan Ephrati, Jeffrey S. Rosenschein
CEC
2008
IEEE
13 years 11 months ago
Divide and conquer evolutionary TSP solution for vehicle path planning
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
Ryan J. Meuth, Donald C. Wunsch