| T. Ishida. Real-time search for autonomous agents and multiagent systems. Autonomous Agents and Multi-Agent Systems, 1:139--167, 1998. |
....role in building intelligent systems is not new in AI, and there is available work that is of particular relevance from the point of view of CCAF. For instance, there are approaches to reactive and anytime planning (e.g. 5, 6, 12, 13, 15, 22,23, 40] and also [30, 35] real time search (e.g. [25,27, 31]) constraint based negotiation (e.g. 41, 44, 47] negotiation interaction based constraint satisfaction (e.g. 9, 33] anytime constraint satisfaction (e.g. 36, 56, 61] soft contracting that allows agents to break contracts and thus to act more exibly e.g. in response to unexpected ....
T. Ishida. Real-time search for autonomous agents and multiagent systems. Autonomous Agents and Multi-Agent Systems, 1:139-167, 1998.
....of potentially applicable actions and or the costs for communication increase, methods and heuristics that enable multiple agents to prune their planning tree have to be applied. This does also hold for time critical applications. Work that appears to be useful for solving this limitation is e.g. Ish98, YK96] The JPJL algorithm assumes that the planning depth is xed and prede ned. As the experimental results indicated, it is desirable that this is handled much more exible. One way to cope with this limitation might be that the planning depth varies over time (e.g. starting with a low ....
T. Ishida. Real-time search for autonomous agents and multiagent systems. Autonomous Agents and Multi-Agent Systems, 1:139-167, 1998.
No context found.
T. Ishida. Real-time search for autonomous agents and multiagent systems. Autonomous Agents and Multi-Agent Systems, 1:139--167, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC