| Andrew Garland and Richard Alterman. Learning cooperative procedures. In AIPS workshop on Integrating Planning, Scheduling and Execution in Dynamic and Uncertain Environments, 1998. |
....in two different domains (robot navigation and resource sharing) The convergence of this type of algorithms is often achieved after several hundred of trials, thus the approach is likely to be more effective in domains where agents repeatedly perform similar tasks. In the MAS discussed in [14] each agent learns cooperative procedures which are then used by a planner assuming complete and accurate knowledge of agents and the environment. 8 Conclusions In this paper we have presented an approach to represent coordination relationships in an uncertain multi agent environment. The ....
Andrew Garland and Richard Alterman. Learning cooperative procedures. In AIPS workshop on Integrating Planning, Scheduling and Execution in Dynamic and Uncertain Environments, 1998.
No context found.
Garland, A., and Alterman, R. Learning Cooperative Procedures, in Bergman, R. and Kott, A. (eds.), 1998 AIPS workshop on Integrating Planning, Scheduling and Execution in Dynamic and Uncertain Environments, AAAI Technical Report WS-98-02, AAAI Press, 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