Sciweavers

4894 search results - page 102 / 979
» Dynamic Abstraction Planning
Sort
View
AAAI
1998
14 years 11 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
15 years 4 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner
TKDE
2012
487views Formal Methods» more  TKDE 2012»
13 years 13 days ago
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...
Rajeev Gupta, Krithi Ramamritham
IROS
2008
IEEE
146views Robotics» more  IROS 2008»
15 years 4 months ago
Optimal distributed planning for self assembly of modular manipulators
— We describe algorithms to build self-assembling robot systems composed of active modular robots and passive bars. The distributed algorithms are based on locally optimal matchi...
Seung-kook Yun, Daniela Rus
ICRA
2005
IEEE
101views Robotics» more  ICRA 2005»
15 years 3 months ago
Near Time-optimal Constrained Trajectory Planning on Outdoor Terrain
— We present an outdoor terrain planner that finds near optimal trajectories under dynamic and kinematic constraints. The planner can find solutions in close to real time by re...
Marin Kobilarov, Gaurav S. Sukhatme