Sciweavers

42 search results - page 7 / 9
» Multiple Agents Moving Target Search
Sort
View
AROBOTS
2000
108views more  AROBOTS 2000»
13 years 5 months ago
Robot Awareness in Cooperative Mobile Robot Learning
Most of the straight-forward learning approaches in cooperative robotics imply for each learning robot a state space growth exponential in the number of team members. To remedy the...
Claude F. Touzet
IROS
2007
IEEE
99views Robotics» more  IROS 2007»
14 years 1 days ago
Multi-robot routing with rewards and disjoint time windows
Abstract— Multiple robots are often faster and more faulttolerant than single robots for applications such as planetary exploration and search and rescue. We study applications w...
Justin Melvin, Pinar Keskinocak, Sven Koenig, Crai...
CP
2007
Springer
13 years 12 months ago
Min-Domain Ordering for Asynchronous Backtracking
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
Roie Zivan, Moshe Zazone, Amnon Meisels
ICPR
2000
IEEE
13 years 10 months ago
Incremental Observable-Area Modeling for Cooperative Tracking
In this paper, we propose an observable-area model of the scene for real-time cooperative object tracking by multiple cameras. The knowledge of partners’ abilities is necessary ...
Norimichi Ukita, Takashi Matsuyama
ASIAN
1999
Springer
186views Algorithms» more  ASIAN 1999»
13 years 10 months ago
Ant Colony Optimization for the Ship Berthing Problem
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
Chia Jim Tong, Hoong Chuin Lau, Andrew Lim