P. R. Young and P. Lehner. Applications of a Theory of Automated Adversarial Planning to Command and Control. IEEE Transactions on Systems, Man and Cybernetics, 16(6):186-294, 1990.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Applying Adversarial Planning Techniques to Go - Willmott, Richardson, Bundy.. (2001) (Correct)
....the PARADISE system for Chess. Using goals to guide search, PARADISE was able to #nd moves which involved looking as far ahead as 20 ply in certain situations, a depth well beyond its contemporary search intensive competitors. More recent work studies battle#eld management [1] command and control [50], and Bridge [39, 40] The work on Bridge is perhaps the most successful application of goal driven reasoning to games to date, presenting a system for Bridge declarer play (TIGNUM2) good enough to beat the current top commercial computer player [39] Frank et al. 19] describes the FINESSE ....
P.R. Young, P. Lehner, Applications of a theory of automated adversarial planning to command and control, IEEE Trans. Systems Man Cybernet. 16 (6) (1990) 186--294.
Applying Adversarial Planning Techniques to Go - Willmott, Richardson, Bundy.. (1999) (Correct)
....Paradise system for Chess. Using goals to guide search, Paradise was able to find moves which involved looking as far ahead as 20 ply in certain situations, a depth well beyond its contemporary search intensive competitors. More recent work studies battlefield management [1] command and control [50], and Bridge [39,40] The work on Bridge is perhaps the most successful application of goal driven reasoning to games to date, presenting a system for Bridge declarer play (Tignum2) good enough to beat the current top commercial computer player [39] 19] describes the Finesse program for Bridge ....
P. R. Young and P. Lehner. Applications of a Theory of Automated Adversarial Planning to Command and Control. IEEE Transactions on Systems, Man and Cybernetics, 16(6):186--294, 1990. 42
Adversarial Planning in Complex Domains - Willmott, Bundy, Levine.. (1998) (Correct)
....problem is inherently more complex than standard planning. A plan can no longer be seen as a sequence of actions with a successful outcome but must be a tree of contingencies for all possible orderings of the opponent s actions 7 . Any 5 Taken from the Go domain. 6 Exceptions to this are [1] [16] and [12] 7 The structure of an adversarial plan is described in Section 2. c fl 1998 S.Willmott, A.Bundy, J.Richardson, J.Levine Submitted to ECAI 98 January 20, 1998 system using this approach must therefore be able to control this work load effectively to stand a chance of being useful. ....
....J.Levine ALPHA BETA 00 00 11 11 00 00 11 11 00 00 11 11 000111 000 000 111 111 0 0 1 1 Action Action Key: Primitive Abstract Goal Plan Flow Figure 1. Planning steps alternating between two agents. also no restrictions on orderings between the goals as found in [16] which forces the goals and subgoals of the adversaries to be paired off with one another (this was found often to be too restrictive when expressing knowledge) The system therefore dynamically manages the turn ordering between the agents as goals are decomposed and it becomes clear varying ....
P. R. Young and P. Lehner, `Applications of a theory of automated adversarial planning to command and control ', IEEE Transactions on Systems, Man and Cybernetics, 16(6), 186--294, (1990). Submitted ECAI-98. 7 S.Willmott, A.Bundy, J.Richardson, J.Levine
An Adversarial Planning Approach to Go - Willmott, Richardson, Bundy, Levine (1998) (3 citations) (Correct)
No context found.
P. R. Young and P. Lehner. Applications of a Theory of Automated Adversarial Planning to Command and Control. IEEE Transactions on Systems, Man and Cybernetics, 16(6):186-294, 1990.
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