Sciweavers

914 search results - page 75 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
ICRA
2007
IEEE
130views Robotics» more  ICRA 2007»
14 years 5 months ago
Greedy but Safe Replanning under Kinodynamic Constraints
— We consider motion planning problems for a vehicle with kinodynamic constraints, where there is partial knowledge about the environment and replanning is required. We present a...
Kostas E. Bekris, Lydia E. Kavraki
GIS
2007
ACM
14 years 12 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
12 years 1 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
AI
1998
Springer
13 years 10 months ago
The Logical Foundations of Goal-Regression Planning in Autonomous Agents
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
John L. Pollock
ISOLA
2004
Springer
14 years 4 months ago
A Formal Analysis of Bluetooth Device Discovery
Abstract. This paper presents a formal analysis of the device discovery phase of the Bluetooth wireless communication protocol. The performance of this process is the result of a c...
Marie Duflot, Marta Z. Kwiatkowska, Gethin Norman,...