Sciweavers

405 search results - page 28 / 81
» AI planning: solutions for real world problems
Sort
View
JAIR
2008
107views more  JAIR 2008»
13 years 7 months ago
Planning with Durative Actions in Stochastic Domains
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
Mausam, Daniel S. Weld
RAS
2002
129views more  RAS 2002»
13 years 7 months ago
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
14 years 7 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
AAAI
2006
13 years 9 months ago
Reasoning about Partially Observed Actions
Partially observed actions are observations of action executions in which we are uncertain about the identity of objects, agents, or locations involved in the actions (e.g., we kn...
Megan Nance, Adam Vogel, Eyal Amir
ATMOS
2008
187views Optimization» more  ATMOS 2008»
13 years 9 months ago
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
Karl Nachtigall, Jens Opitz