1102 search results - page 6 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
AIPS
1994
15 years 1 months ago
1994
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
117
click to vote
CI
2011
14 years 7 months ago
2011
This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment pro...
IROS
2009
IEEE
15 years 7 months ago
2009
IEEE
— This paper presents a decentralized planning method for generating dynamic whole body motions of multilink robots including humanoids. First, a robotic system will be modeled a...
KBS
2007
15 years 4 days ago
2007
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
127
Voted
AAAI
1994
15 years 1 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...