Sciweavers

348 search results - page 40 / 70
» Search Ordering Heuristics for Restarts-Based Constraint Sol...
Sort
View
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
14 years 1 months ago
Greedy but Safe Replanning under Kinodynamic Constraints
— We consider motion planning problems for a vehicle with kinodynamic constraints, where there is partial knowledge about the environment and replanning is required. We present a...
Kostas E. Bekris, Lydia E. Kavraki
AUSAI
2008
Springer
13 years 9 months ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan
IAT
2009
IEEE
14 years 2 months ago
Distributed Constraint Optimization for Large Teams of Mobile Sensing Agents
Abstract. A team of mobile sensors can be used for coverage of targets in different environments. The dynamic nature of such an application requires the team of agents to adjust th...
Roie Zivan, Robin Glinton, Katia P. Sycara
DATE
2008
IEEE
93views Hardware» more  DATE 2008»
14 years 2 months ago
A Fast Approximation Algorithm for MIN-ONE SAT
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The ...
Lei Fang, Michael S. Hsiao
FLAIRS
2004
13 years 9 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels