Sciweavers

1146 search results - page 59 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
SIGSOFT
1996
ACM
14 years 5 hour ago
Tool Support for Planning the Restructuring of Data Abstractions in Large Systems
Abstractions in Large Systems William G. Griswold, Member, IEEE, Morison I. Chen, Robert W. Bowdidge, Jenny L. Cabaniss, Van B. Nguyen, and J. David Morgenthaler Restructuring soft...
William G. Griswold, Morison I. Chen, Robert W. Bo...
ICRA
2005
IEEE
150views Robotics» more  ICRA 2005»
14 years 1 months ago
Complex Task Allocation For Multiple Robots
Abstract— Recent research trends and technology developments are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missions. ...
Robert Zlot, Anthony Stentz
IJCAI
2003
13 years 9 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
JAIR
2008
130views more  JAIR 2008»
13 years 7 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
AIPS
2009
13 years 9 months ago
Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla