;; For a complete description of all compiler switches given the current optimization settings evaluate
;; For a complete description of all compiler switches given the current optimization settings evaluate
;; (EXPLAIN-COMPILER-SETTINGS).
;; (EXPLAIN-COMPILER-SETTINGS).
...
@@ -145,20 +136,20 @@ Is execution outcome success (s), failure (f), or exception (x)?:s
...
@@ -145,20 +136,20 @@ Is execution outcome success (s), failure (f), or exception (x)?:s
Sample environment!
Sample environment!
Is execution outcome success (s), failure (f), or exception (x)?:x
Is execution outcome success (s), failure (f), or exception (x)?:x
Rendezvous with Vehicle2!
Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:f
Is execution outcome success (s), failure (f), or exception (x)?:s
Proceed to recovery!
Proceed to recovery!
((S X F) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
((S X S) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(13): (run)
CG-USER(13): (run)
Search Area A!
Search Area A!
Is execution outcome success (s), failure (f), or exception (x)?:s
Is execution outcome success (s), failure (f), or exception (x)?:s
Sample environment!
Sample environment!
Is execution outcome success (s), failure (f), or exception (x)?:x
Is execution outcome success (s), failure (f), or exception (x)?:x
Rendezvous with Vehicle2!
Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:s
Is execution outcome success (s), failure (f), or exception (x)?:f
Proceed to recovery!
Proceed to recovery!
((S X S) (S X F) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
((S X F) (S X S) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(14): (run)
CG-USER(14): (run)
Search Area A!
Search Area A!
Is execution outcome success (s), failure (f), or exception (x)?:s
Is execution outcome success (s), failure (f), or exception (x)?:s
...
@@ -168,7 +159,7 @@ Rendezvous with Vehicle2!
...
@@ -168,7 +159,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:x
Is execution outcome success (s), failure (f), or exception (x)?:x
Proceed to recovery!
Proceed to recovery!
((S X X) (S X S) (S X F) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
((S X X) (S X F) (S X S) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(15): (run)
CG-USER(15): (run)
Search Area A!
Search Area A!
Is execution outcome success (s), failure (f), or exception (x)?:f
Is execution outcome success (s), failure (f), or exception (x)?:f
...
@@ -178,7 +169,7 @@ Rendezvous with Vehicle2!
...
@@ -178,7 +169,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:s
Is execution outcome success (s), failure (f), or exception (x)?:s
Proceed to recovery!
Proceed to recovery!
((F S S) (S X X) (S X S) (S X F) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
((F S S) (S X X) (S X F) (S X S) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(16): (run)
CG-USER(16): (run)
Search Area A!
Search Area A!
Is execution outcome success (s), failure (f), or exception (x)?:f
Is execution outcome success (s), failure (f), or exception (x)?:f
...
@@ -188,7 +179,7 @@ Rendezvous with Vehicle2!
...
@@ -188,7 +179,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:f
Is execution outcome success (s), failure (f), or exception (x)?:f
Proceed to recovery!
Proceed to recovery!
((F S F) (F S S) (S X X) (S X S) (S X F) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F)
((F S F) (F S S) (S X X) (S X F) (S X S) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F)
(S S S S))
(S S S S))
CG-USER(17): (run)
CG-USER(17): (run)
Search Area A!
Search Area A!
...
@@ -199,7 +190,7 @@ Rendezvous with Vehicle2!
...
@@ -199,7 +190,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:x
Is execution outcome success (s), failure (f), or exception (x)?:x
Proceed to recovery!
Proceed to recovery!
((F S X) (F S F) (F S S) (S X X) (S X S) (S X F) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X)
((F S X) (F S F) (F S S) (S X X) (S X F) (S X S) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X)
(S S S F) (S S S S))
(S S S F) (S S S S))
CG-USER(18): (run)
CG-USER(18): (run)
Search Area A!
Search Area A!
...
@@ -210,7 +201,7 @@ Rendezvous with Vehicle2!
...
@@ -210,7 +201,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:s
Is execution outcome success (s), failure (f), or exception (x)?:s
Proceed to recovery!
Proceed to recovery!
((F F S) (F S X) (F S F) (F S S) (S X X) (S X S) (S X F) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S)
((F F S) (F S X) (F S F) (F S S) (S X X) (S X F) (S X S) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S)
(S S S X) (S S S F) (S S S S))
(S S S X) (S S S F) (S S S S))
CG-USER(19): (run)
CG-USER(19): (run)
Search Area A!
Search Area A!
...
@@ -221,7 +212,7 @@ Rendezvous with Vehicle2!
...
@@ -221,7 +212,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:f
Is execution outcome success (s), failure (f), or exception (x)?:f
Proceed to recovery!
Proceed to recovery!
((F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X S) (S X F) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F)
((F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X F) (S X S) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F)
(S S F S) (S S S X) (S S S F) (S S S S))
(S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(20): (run)
CG-USER(20): (run)
Search Area A!
Search Area A!
...
@@ -232,7 +223,7 @@ Rendezvous with Vehicle2!
...
@@ -232,7 +223,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:x
Is execution outcome success (s), failure (f), or exception (x)?:x
Proceed to recovery!
Proceed to recovery!
((F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X S) (S X F) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F)
((F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X F) (S X S) (S F) (S S X X) (S S X F) (S S X S) (S S F X) (S S F F)
(S S F S) (S S S X) (S S S F) (S S S S))
(S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(21): (run)
CG-USER(21): (run)
Search Area A!
Search Area A!
...
@@ -243,7 +234,7 @@ Rendezvous with Vehicle2!
...
@@ -243,7 +234,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:s
Is execution outcome success (s), failure (f), or exception (x)?:s
Proceed to recovery!
Proceed to recovery!
((F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X S) (S X F) (S F) (S S X X) (S S X F) (S S X S) (S S F X)
((F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X F) (S X S) (S F) (S S X X) (S S X F) (S S X S) (S S F X)
(S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
(S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(22): (run)
CG-USER(22): (run)
Search Area A!
Search Area A!
...
@@ -254,7 +245,7 @@ Rendezvous with Vehicle2!
...
@@ -254,7 +245,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:f
Is execution outcome success (s), failure (f), or exception (x)?:f
Proceed to recovery!
Proceed to recovery!
((F X F) (F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X S) (S X F) (S F) (S S X X) (S S X F) (S S X S)
((F X F) (F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X F) (S X S) (S F) (S S X X) (S S X F) (S S X S)
(S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
(S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(23): (run)
CG-USER(23): (run)
Search Area A!
Search Area A!
...
@@ -265,7 +256,7 @@ Rendezvous with Vehicle2!
...
@@ -265,7 +256,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:x
Is execution outcome success (s), failure (f), or exception (x)?:x
Proceed to recovery!
Proceed to recovery!
((F X X) (F X F) (F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X S) (S X F) (S F) (S S X X) (S S X F)
((F X X) (F X F) (F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X F) (S X S) (S F) (S S X X) (S S X F)
(S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
(S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(24): (run)
CG-USER(24): (run)
Search Area A!
Search Area A!
...
@@ -274,7 +265,7 @@ Rendezvous with Vehicle2!
...
@@ -274,7 +265,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:s
Is execution outcome success (s), failure (f), or exception (x)?:s
Proceed to recovery!
Proceed to recovery!
((X S) (F X X) (F X F) (F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X S) (S X F) (S F) (S S X X) (S S X F)
((X S) (F X X) (F X F) (F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X F) (S X S) (S F) (S S X X) (S S X F)
(S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
(S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(25): (run)
CG-USER(25): (run)
Search Area A!
Search Area A!
...
@@ -283,7 +274,7 @@ Rendezvous with Vehicle2!
...
@@ -283,7 +274,7 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:f
Is execution outcome success (s), failure (f), or exception (x)?:f
Proceed to recovery!
Proceed to recovery!
((X F) (X S) (F X X) (F X F) (F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X S) (S X F) (S F) (S S X X)
((X F) (X S) (F X X) (F X F) (F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X F) (S X S) (S F) (S S X X)
(S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
(S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(26): (run)
CG-USER(26): (run)
Search Area A!
Search Area A!
...
@@ -292,14 +283,14 @@ Rendezvous with Vehicle2!
...
@@ -292,14 +283,14 @@ Rendezvous with Vehicle2!
Is execution outcome success (s), failure (f), or exception (x)?:x
Is execution outcome success (s), failure (f), or exception (x)?:x
Proceed to recovery!
Proceed to recovery!
((X X) (X F) (X S) (F X X) (F X F) (F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X S) (S X F) (S F)
((X X) (X F) (X S) (F X X) (F X F) (F X S) (F F X) (F F F) (F F S) (F S X) (F S F) (F S S) (S X X) (S X F) (S X S) (S F)
(S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
(S S X X) (S S X F) (S S X S) (S S F X) (S S F F) (S S F S) (S S S X) (S S S F) (S S S S))
CG-USER(27):
CG-USER(27):
; Foreign loading winspool.drv.
; Foreign loading winspool.drv.
INTERPRETATION
DISCUSSION
Above is my first success in manually tracing all possible scenarios for outcomes resulting from a human being following orders (mission DAG) for 2018 JOE mission. All outcomes are in decimal serial order except for my response to prompts 12 and 13. These two are reversed in order in the above. Lisp code is June 11 version, sent to all of you by me on 6/14, and archived by Don during our Zoom meeting on 6/16. I propose that we work together to correctly execute these orders in numerical order, using above as a guide, as the first order of business of tomorrow's meeting.
This is our first fully successful human execution of JOE 2018 mission orders, with all possible mission scenario outcomes in numerical order. It was amazingly hard for me to complete this without typos. Recall that "alphabetical order" of each human response to above queries is "s, f, x". Algorithm to respond to each iteration of "(run)" is simply "enter next response sequence with lowest decimal serial number"; i.e., "in alphabetical order".
After we have succeeded in such an effort, I think I will be able to better explain algorithm as part of a new Tech Report provisionally titled "Finding All Possible Execution Scenarios for Robot/Human Missions Defined by Acyclic Process Flow Graphs", Title is also up for discussion as part of tomorrow's meeting.
My next coding goal is to write needed code to be able to prove that human response sequences above are identical to those produced by automated bread-first search (latter results also demonstrated yesterday). Jon, it was a pleasure having you with us yesterday. Please continue to join us for our Tuesday 1300 meetings if you can. Russell reference you sent to us is very helpful to me in understanding our work in reference to others. Briefly, we are NOT working in AI! I consider that our only serious expertise is in finite state machine theory and its application to military matters.