Sciweavers

317 search results - page 12 / 64
» Improving Planning Performance Using Low-Conflict Relaxed Pl...
Sort
View
ISRR
2005
Springer
99views Robotics» more  ISRR 2005»
15 years 4 months ago
On the Probabilistic Foundations of Probabilistic Roadmap Planning
Why is probabilistic roadmap (PRM) planning probabilistic? How does the probability measure used for sampling a robot’s configuration space affect the performance of a PRM plan...
David Hsu, Jean-Claude Latombe, Hanna Kurniawati
ICRA
2009
IEEE
152views Robotics» more  ICRA 2009»
15 years 5 months ago
Reachability-guided sampling for planning under differential constraints
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
Alexander C. Shkolnik, Matthew Walter, Russ Tedrak...
DALT
2007
Springer
15 years 5 months ago
Composing High-Level Plans for Declarative Agent Programming
Abstract. Research on practical models of autonomous agents has largely focused on a procedural view of goal achievement. This allows for efficient implementations, but prevents an...
Felipe Rech Meneguzzi, Michael Luck
ICRA
2009
IEEE
143views Robotics» more  ICRA 2009»
15 years 5 months ago
Randomized model predictive control for robot navigation
— We suggest a new navigation approach to mobile robots, within a nonlinear model predictive control framework where a navigation function is used as a control Lyapunov function....
Jorge L. Piovesan, Herbert G. Tanner
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 4 days ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan