Sciweavers

283 search results - page 33 / 57
» Incremental Deterministic Planning
Sort
View
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
14 years 1 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
INFOCOM
1994
IEEE
13 years 11 months ago
Traffic Models for Wireless Communication Networks
In this paper, we introduce a deterministic fluid model and two stochastic traffic models for wireless networks. The setting is a highway with multiple entrances and exits. Vehicl...
Kin K. Leung, William A. Massey, Ward Whitt
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 7 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
AI
2011
Springer
13 years 2 months ago
Approximation of action theories and its application to conformant planning
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ric...
AIPS
1998
13 years 9 months ago
Solving Stochastic Planning Problems with Large State and Action Spaces
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
Thomas Dean, Robert Givan, Kee-Eung Kim