Sciweavers

74 search results - page 5 / 15
» Computing Robust Plans in Continuous Domains
Sort
View
AIPS
2008
14 years 3 days ago
HiPPo: Hierarchical POMDPs for Planning Information Processing and Sensing Actions on a Robot
Flexible general purpose robots need to tailor their visual processing to their task, on the fly. We propose a new approach to this within a planning framework, where the goal is ...
Mohan Sridharan, Jeremy L. Wyatt, Richard Dearden
AI
2008
Springer
13 years 10 months ago
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
ATAL
2009
Springer
13 years 11 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso
COMPGEOM
2004
ACM
14 years 1 months ago
Continuous path verification in multi-axis NC-machining
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperi...
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
14 years 2 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen