Sciweavers

469 search results - page 1 / 94
» A Branch-and-Prune Algorithm for Solving Systems of Distance...
Sort
View
ICRA
2003
IEEE
101views Robotics» more  ICRA 2003»
13 years 9 months ago
A Branch-and-Prune Algorithm for Solving Systems of Distance Constraints
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
Josep M. Porta, Federico Thomas, Lluís Ros,...
CONSTRAINTS
2002
96views more  CONSTRAINTS 2002»
13 years 4 months ago
QOCA: A Constraint Solving Toolkit for Interactive Graphical Applications
We describe an object-oriented constraint solving toolkit, QOCA, designed for interactive graphical applications. It has a simple yet powerful interface based on the metric space m...
Kim Marriott, Sitt Sen Chok
CSCLP
2004
Springer
13 years 9 months ago
A System Prototype for Solving Multi-granularity Temporal CSP
Abstract. Time granularity constraint reasoning is likely to have a relevant role in emerging applications like GIS, time management in the Web and Personal Information Management ...
Claudio Bettini, Sergio Mascetti, Vincenzo Pupillo
JAIR
2006
131views more  JAIR 2006»
13 years 4 months ago
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
Roger Mailler, Victor R. Lesser
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
13 years 2 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...