Sciweavers

1146 search results - page 61 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
ECAI
2006
Springer
13 years 11 months ago
Formalizing Complex Task Libraries in Golog
We present an approach to building libraries of tasks in complex action languages such as Golog, for query answering. Our formalization is based on a situation calculus framework t...
Alfredo Gabaldon
ATAL
2010
Springer
13 years 9 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
HCI
2009
13 years 5 months ago
Studying Reactive, Risky, Complex, Long-Spanning, and Collaborative Work: The Case of IT Service Delivery
Abstract. IT service delivery is challenging to study. It is characterized by interacting systems of technology, people, and organizations. The work is sometimes reactive, sometime...
Eser Kandogan, Eben M. Haber, John H. Bailey, Paul...
ICRA
2005
IEEE
101views Robotics» more  ICRA 2005»
14 years 1 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
BMVC
1998
13 years 9 months ago
A Two-Stage Algorithm for Planning the Next View From Range Images
A new technique is presented for determining the positions where a range sensor should be located to acquire the surfaces of a complex scene. The algorithm consists of two stages....
Miguel Angel García, Susana Velázque...