Sciweavers

69 search results - page 4 / 14
» Let's Plan It Deductively!
Sort
View
AIR
2004
132views more  AIR 2004»
15 years 5 months ago
Sarcasm, Deception, and Stating the Obvious: Planning Dialogue without Speech Acts
This paper presents an alternative to the `speech acts with STRIPS' approach to implementing dialogue: a fully implemented AI planner which generates and analyses the semantic...
Debora Field, Allan Ramsay
COMPGEOM
2004
ACM
15 years 11 months ago
On lines avoiding unit balls in three dimensions
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, M...
ICRA
2009
IEEE
121views Robotics» more  ICRA 2009»
16 years 19 days ago
Task-space trajectories via cubic spline optimization
Abstract— We consider the task of planning smooth trajectories for robot motion. In this paper we make two contributions. First we present a method for cubic spline optimization;...
J. Zico Kolter, Andrew Y. Ng
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
15 years 11 months ago
Planning with Continuous Actions in Partially Observable Environments
Abstract— We present a simple randomized POMDP algorithm for planning with continuous actions in partially observable environments. Our algorithm operates on a set of reachable b...
Matthijs T. J. Spaan, Nikos A. Vlassis
ICRA
2010
IEEE
106views Robotics» more  ICRA 2010»
15 years 4 months ago
Computing push plans for disk-shaped robots
Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for...
Mark de Berg, Dirk H. P. Gerrits