Sciweavers

810 search results - page 20 / 162
» Solving Time-Dependent Planning Problems
Sort
View
AGENTS
1997
Springer
14 years 1 months ago
Progressive Negotiation For Time-Constrained Autonomous Agents
We address in this paper a problem of autonomous agents performing in a common environment where each agent has its goal to achieve before a given deadline. Agents must be able to...
Abdel-Illah Mouaddib
AAAI
2004
13 years 10 months ago
Effective Approaches for Partial Satisfaction (Over-Subscription) Planning
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a sub...
Menkes van den Briel, Romeo Sanchez Nigenda, Minh ...
INFOCOM
1998
IEEE
14 years 1 months ago
Demand-based Radio Network Planning of Cellular Mobile Communication Systems
: This paper presents a demand-based engineering method for designing radio networks of cellularmobile communicationsystems. The proposed procedure is based on a forward-engineerin...
Kurt Tutschku
CVPR
1999
IEEE
14 years 1 months ago
Sensor Planning for a Trinocular Active Vision System
We present an algorithm to solve the sensor planning problem for a trinocular, active vision system. This algorithm uses an iterative optimization method to rst solve for the tran...
Peter Lehel, Elsayed E. Hemayed, Aly A. Farag
ECAI
2008
Springer
13 years 11 months ago
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...
Alfonso Gerevini, Ugur Kuter, Dana S. Nau, Alessan...