Cognitive Supervisor for an Autonomous Swarm of Robots

As a sequel to our recent work [1], in which a control framework was developed for large-scale joint swarms of unmanned ground (UGV) and aerial (UAV) vehicles, the present paper proposes cognitive and meta-cognitive supervisor models for this kind of distributed robotic system. The cognitive supervisor model is a formalization of the recently Nobel-awarded research in brain science on mammalian and human path integration and navigation, performed by the hippocampus. This is formalized here as an adaptive Hamiltonian path integral, and efficiently simulated for implementation on robotic vehicles as a pair of coupled nonlinear Schrödinger equations. The meta-cognitive supervisor model is a modal logic of actions and plans that hinges on a weak causality relation that specifies when atoms may change their values without specifying that they must change. This relatively simple logic is decidable yet sufficiently expressive to support the level of inference needed in our application. The atoms and action primitives of the logic framework also provide a straightforward way of connecting the meta-cognitive supervisor with the cognitive supervisor, with other modules, and to the meta-cognitive supervisors of other robotic platforms in the swarm.


Introduction
Recently, we have proposed in [1] a rigorous model for prediction and control of a large-scale joint swarm of unmanned ground vehicles (UGVs) and unmanned aerial vehicles (UAVs), performing an autonomous land-air operation.In that paper, we have also introduced a need for a cognitive supervisor for the high-dimensional distributed multi-robotic system.Its primary task is to have a birdseye view of the situation across the joint land-air operation, and based on the GPS locations of both the target and all included robots, to provide them with good 2D and 3D attractor fields so that they can reach the proximity of the target in the shortest possible time.The purpose of the present paper is to develop a rigorous model for this cognitive supervisor, based on recent discoveries in brain science that show us how humans navigate in 2D environments and how bats navigate in 3D environments, and to couple this with a meta-cognitive supervisor model that allows vehicles to reason about actions and construct simple plans.
The 2014 Nobel Prize in Physiology or Medicine was awarded jointly to John O'Keefe, May-Britt Moser and Edvard I. Moser "for their discoveries of cells that constitute a positioning system in the brain'', in other words, for the hippocampus path integration and navigation system.
Briefly, there is a part of a mammal brain, called the hippocampal formation, which in humans is mostly developed in taxi drivers, grows in size with their experience and can be also trained (like a muscle) using fast-action video games.
The hippocampal formation provides a cognitive map of a familiar environment which can be used to identify one's current location and to navigate from one place to another.This mapping system provides two independent strategies for locating places, one based on environmental landmarks and the other on a path integration system (see [2] [3] and the references therein), which uses informa- tion about distances traveled in particular directions.This brain navigation system exists in all mammals, while in humans it additionally provides the basis for the so-called episodic memory [4]. 1   Two main components of the hippocampal formation (discovered by O'Keefe) are: (i) hippocampal place cells, and (ii) grid cells from the entorhinal cortex (discovered by Mosers).In particular, according to Edvard Moser, "All network models for grid cells involve continuous attractors ..."-which is similar to our attractor Hamiltonian dynamics of UGVs and UAVs, given by Equations ( 1)- (2) in the next section.
As inspired by this discovery in brain science, the present paper proposes a novel probabilistic spatio-temporal model for mammalian path integration and navigation, formulated as an adaptive Hamiltonian path integral.The model combines: (i) a cognitive map ( ) p t performed by hippocampal place cells, (ii) an entorhinal map ( ) q t performed by grid cells, (iii) a current of sensory (extra-hippocampal) stimuli ( ) J t , and (iv) Hebbian learning in hippocampal synaptic weights ( ) w t .This model represents an infinite-dimensional neural network, which can be simulated (using 10 6 -10 7 neurons) on IBM's TrueNorth chip.
We also propose to couple this cognitive supervisor to a meta-cognitive supervisor, supporting dynamic mission planning, using on an established propositional multimodal logic framework.This approach gives robotic vehicles the ability to construct and execute simple plans on the fly against goals, given local sensor information, state information communicated locally between vehicles, and aspects of the state of the robot itself.The coupling to the cognitive supervisor and to the outside world is through the truth value of logical atoms and using multimodal actions.

Affine Hamiltonian Control for a Joint (UGV + UAV) Swarm
The affine Hamiltonian control model with many degrees-of-freedom has been presented in the form of 2n-dimensional (2ND) Langevin-type attractor matrix equations with nearest-neighbor couplings, which represent two recurrent neural networks: UGV-swarm: . UAV-swarm: .
The following terms are used in Equations ( 1) and ( 2): ( ) ( ) are time-evolving matrices defining coordinates and momenta of the UGV-swarm, respectively, with initial conditions: ( ) ( ) ( ) are time-evolving tensors defining coordinates and momenta of the UAV-swarm, respectively, with initial conditions: ( ) ( ) A q and 2D A p are the 2D attractors for the UGV swarm, while η are zero-mean, delta-correlated, Gaussian white noises added to q and p variables in both swarms.For more technical details on affine Hamiltonian (or, similar, port-Hamiltonian) control of large-scale dynamical systems, see [1] and the references therein.
The purpose of the cognitive supervisor is to provide the 2D and 3D inputs to the recurrent neural nets (1)-( 2), or specifically, 2D attractors ( ) for the UGV-swarm and 3D attractors ( ) q p for the UAV-swarm (see, e.g.[5]).

Adaptive Hamiltonian Path Integral
In his recent Nobel lecture, John O'Keefe referred to his pioneering 1976-paper [6] [7], describing the function of the hippocampal place cells performing Tolman's cognitive mapping: "When an animal had located itself in an environment (using environmental stimuli) the hippocampus could calculate subsequent positions in that environment on the basis of how far and in what direction the animal had moved in the interim ..." This quotation was accompanied by a commutative diagram depicting the vector addition and a suggestion that an animal moves in a sequence of vectors.
This extract from O'Keefe's lecture is the motivation for the present mathematical model.Basically, any two-dimensional (2D) vector is equivalent to a complex number: i , z x y = + where ( , x y ) are Cartesian coordinates and i 1. = − The same complex number z can be also given in the polar form as: , where r is the radius vector and θ is the heading.The sequence of N vectors is the sum of complex numbers: particle likeanimalmotion i e .
In this way, we can describe a particle-like animal motion in the complex plane ,  from some initial point A to the final point , B performed in N steps, as an integral complex number (3).This basic idea describes an animal's motion in purely static and deterministic terms; it can be generalized into a more realistic, probabilistic dynamics, as follows. 2  Now, instead of the complex plane  , consider a particle-like animal motion in the phase plane (p-q), where ( ) represents the action of the hippocampal place cells and ( ) , q q t x = defines the action of the entorhinal grid cells.The animal moves from some initial point A given by canonical coordinates ( 0 0 , q p ) at initial time 0 t , to the final point B given by canonical coordinate ( 1 1 , q p ) at final time 1 t , via all possible paths, each path having an equal probability (so that the sum of all path-probabilities is = 1).This most general 2D motion is properly defined by the transition amplitude: , , , , B A q p t q p t ≡ whose absolute square represents the transition probability density function: The transition amplitude B A can be calculated via the following Hamiltonian path integral 3 2 For For simplicity reasons, we are using the same Hamiltonian symbols, q and p , for the cogni- tive representation of robotic coordinates and momenta, to emphasize the one-to-one correspondence between the physical robotic level and the mental supervisor level.However, while at the physical robotic level, ( ) ( )  The path integral (4) was formulated by R. Feynman in [10].It has been widely appreciated that the phase-space (i.e., Hamiltonian) path integral is more generally applicable, or more robust, than the original, Lagrangian version of the path integral, introduced in Feynman's first paper [11].For example, the original Lagrangian path integral is satisfactory for Lagrangians of the form: but it is unsuitable, e.g., for the case of a particle with the Lagrangian (in normal units): ( ) − For such a system (as well as many more general expres- sions) the Hamiltonian path integral is more robust; e.g., the Hamiltonian path integral for the free particle: where the integration is performed over the ( ) p τ and ( ) q τ values at every time , τ with the time-step .
For technical details of the derivation of the Hamiltonian path integral (4), see e.g.[8] [9] and the references therein.
Next, the sources from various extra-hippocampal stimuli can be incorporated into the basic transition amplitude (4) by adding some form of a bio-electric current J , as: where [ ] 1 1 1 0 0 0 , , , , Z J q p t q p t = is the system's partition function dependent on the current J and obeying the normalization condition: [ ] A generalization from a single particle Hamiltonian path integral (4) to the probabilistic dynamics of an N-particle system is straightforward.The phasespace functional integral that defines the transition amplitude , from the initial ND point ( ) where we are allowing for the full Hamiltonian of the system ( ) , k k H p q to depend upon all the N coordinates ( ) k q τ and momenta ( ) k p τ collectively.Again, we can add various sources as incoming bio-currents k J as a straightforward generalization of the single-particle partition function (5) to the system of N particles: is the system's partition function dependent on all the incoming currents k J and obeying the normalization condition: where the weights ( ) k w τ are adapted (in a discrete time) by Hebbian-type learning: where represent local signal and noise amplitudes, respectively, while superscripts D and A denote desired and achieved system states, respectively.
The system (6-7) defines the proposed adaptive Hamiltonian path integral model for a generic mammalian path integration and navigation.Both the sequential (Ising spin) Hopfield network [13] with its Galuber dynamics and the graded-response Hopfield network [14] with its Fokker-Planck dynamics can be considered as special cases of this general Hamiltonian neural system.
Direct computer simulations of the adaptive Hamiltonian path integral system (6-7) can be performed on the IBM TrueNorth chip (see [15] and the references therein) as a Markov-chain Monte Carlo simulation over a grid of Hopfield nets (which are already implemented in the TrueNorth chip, using 10 6 -10 7 artificial neurons).
In the next section we propose a more efficient approach to simulate the path integral system (6-7).

A Pair of Coupled Nonlinear Schrödinger Equations
In this section, instead of the direct computer simulations on a supercomputer, we will present an indirect approach of simulating the path integral system (6-7) on an ordinary PC, represented as a pair of coupled nonlinear Schrödinger (NLS) equations.In his first paper [11], Feynman showed that his Lagrangian q-path integral was equivalent to the standard linear Schrödinger equation from quantum mechanics, given here for the case of a free particle (in natural physical units: 1, which defines the complex-valued microscopic wave function ( ) defines the probability density function (PDF).
In the last decade it was shown (see [16] and the references therein) that if the linear Schrödinger Equation ( 8) is put into an adaptive (iterative) feedback loop, it adds a cubic nonlinearity with a potential field ( ) and becomes the NLS equation: which now defines the macroscopic wave function ( ) x t ψ still defines the PDF [17].A variety of analytical solutions for the NLS Equation ( 9) have been reported in [18] [19].
Finally, to represent the Hamiltonian ( ) , q p -path integral, we can use the ( ) , q p -pair of NLS equations, as follows.

Special Case: Analytical Soliton
We start with a simple ( ) , q p -NLS pair representation for the path integral system (6-7), which admits the analytical closed-form solution, given by the so-called Manakov system (with the constant potential V ):4 ( ) which was proven in [20], using the Lax pair representation [21], to be completely integrable Hamiltonian system, by the existence of infinite number of involutive integrals of motion.
The ( ) , q p -NLS pair ( 10)-( 11) admits both "bright" and "dark" soliton as solutions, of which the simplest one is the so-called Manakov bright 2-soliton given by: where a and b are real-valued parameters and

General Case: Numerical Simulation
Now that we have introduced the simple ( ) , q p -NLS pair, we can define our real representation for the path integral system (6-7), as the following more general ( ) , q p -NLS pair: including the bell-shaped (sech) spatiotemporal potentials: and the soft-step shaped (tanh) spatiotemporal input currents: , tanh , , tanh , I t x a a t x J t x a a t x = = together with the common initial condition: ( ) ( ) the set of parameters: ( ) and the set of adaptive synaptic weights .
k w The ( ) , q p -NLS pair ( 13)-( 14) has been numerically simulated in mathema-tica®, producing 3D plots of real and imaginary parts of the ( ) , q p -wave functions (see Figure 1) and density plots of attractor fields for robotic swarms (see Figure 2), using the following code:  Defining potentials: TensorProductGrid , DifferenceOrder Pseudospectral ; The bidirectional associative memory, given by the NLS-pair ( 13)-( 14) effectively performs quantum neural computation, by giving a spatiotemporal generalization of Hopfield, Grossberg and Kosko BAM family of recurrent neural networks (see [16] and the references therein).In addition, the shock-wave and solitary-wave nature of the coupled NLS equations may describe brain-like effects: propagation, reflection and collision of shock and solitary waves (see [24]).

Meta-Cognitive Supervisor
The meta-cognitive supervisor model is concerned with equipping the elements of the robotic swarm with a limited capability for higher reasoning about potential consequences of its actions, using logical constraints that attempt to rule out actions leading to states that we wish to avoid.That is not to say that such states will never occur, so we also require considerable flexibility in our formulation, in the sense that it should maintain the potential to continue to operate under adverse conditions including partial system failure.Yet we require a formalism for capturing this that is as simple as possible, decidable, and computationally feasi-ble in practice on small platforms; in this sense, we regard the Situation Calculus as too rich for our present purpose, since it is inherently first-order and consequently undecidable.
Our starting point is with the logic of actions and plans  , which is broadly similar to the propositional dynamic logic  [25] [26], with the difference being that the necessity operator  in  is slightly less expres- sive (and hence less expensive) than the iteration operator * in  .This loss of expressivity does not currently appear to be a limiting factor in our application, while the compactness and strong completeness of  -which is not shared by  -represent a distinct advantage in the demanding highly dynamic context of our application and the limited resources of our envisaged platforms.
The logic of necessity  in  is S4 [27], and  has a dual possibility operator ◊ , which is used to express goals.The logic of each modal operator [ ] υ , where V υ ∈ is a countable set of verbs designating distinct actions, is the basic modal logic K [27].We also include a null action V ∅ ∈ .There is also a countable set A of atoms, which designate relevant state conditions in the en- vironment (including within robotic system itself).The set of literals A con- sists of all atoms a A ∈ and their negations a ¬ .We symbolize the canonical tautology as  , which evaluates to true in all interpretations, and the canonical contradiction as ⊥ , which evaluates to false in all interpretations.Formulae are then defined in the usual manner:  and ⊥ are formulae, all literals a and a ¬ for a A ∈ are formulae, and conjunctions f g ∧ , dis- junctions f g ∨ , and material implications f g → are formulae if f and g are formulae, and [ ] f υ is a formula if f is a formula and V υ ∈ is a verb.Nothing else is a formula.
For our application, we utilize a message passing approach for distributed communication, so actions for local broadcast of meta-cognitive supervisor messages are represented logically in meta-cognition as verbs and any messages received appear as atoms.Note also that this framework admits interaction with the cognitive supervisor, in both directions; specifically, some actions define initial conditions for the determination of the 2D ( ) and 3D ( ) attractors.Actions for attractor determination are relative to platform position rather than absolute.A formula that does not contain any of the modal operators Possibility and necessity are related as f f ◊ ≡ ¬ ¬  , and we write f υ to mean [ ] f υ ¬ ¬ .Goals are formulas having the form f ◊ , where f is classical.
For every verb V ∈ υ and formula f , we have [ ] , which means that the formula f is invariant; formulae of the form f  constitute integrity constraints.When f in f  is classical, the constraint is a static constraint, while f  where f contains [ ] υ for some V υ ∈ is a dynamic constraint that describes some action law.We are especially concerned with effect constraints, which have the form ( ) , which we abbreviate as [ ] The major weakness with using  directly lies in the large number of frame axioms required; these axioms in bulk means that any action changes the truth value of relatively few formulae, which bogs down the inference procedure.
Even though our current meta-cognitive definitions are small, these frame axioms would likely still be sufficiently numerous to cause problems for the limited computational resources we typically expect on the currently available small and cheap platforms our research is targeting.Consequently, our choice of logic of action and plans is a variant of  , namely  [28], which employs a weak ternary causal dependence relation involving atoms, actions and conditions to overcome the frame problem.This logic also means that our meta-cognitive supervisor is able to derive indirect effects of actions, which we expect will be very important in terms of being able to reason about exposure to unacceptable failure.
The logic  is a variant of the earlier   [29], which also solves the frame problem using a notion of weak causal dependence.The attraction for our problem of  over   is that the former supports more compact domain descriptions without decreasing expressibility, increasing complexity or sacrificing decidability; using the latter would force us to still have to explicitly state conditional frame axioms, which have the form . In  .In either system we still have to state indirect dependencies.
In contrast to the ternary dependence relation provided by our choice of  , the dependence relation in   is a binary relation  between actions and literals; it is actually the complementary independence relation  that is used here to encode frame axioms, according to is not needed in the domain description.In our case, the conditions f in f a υ  are always con- junctions of literals, because disjunctions can be simply split into separate dependence statements.Figure 3 contains a small example of a robot meta-cognition scenario in  .The logic  is decidable, with the satisfiability problem being EXPTIME-complete, which is the same decidability and complexity as the base system  .A tableau method for  is simply a combination of the tableau rules for the logics S4 and K, while   and  require ad- ditional rules to handle their dependency relations.We use a notational variant of the definitions from [29] for tableau rules for   , with the different rules from [28] for the ternary weak dependence relation | ⋅ ⋅  in place of those for ⋅ ⋅  to describe the tableau calculus.
A labeled formula is a pair ( ) , n f where f is a formula and n is from a countable set of labels for possible worlds; we just use the non-negative integers , L Σ consisting of a set L of labeled formulae and a skeleton Σ .A tableau for f is then the limit of a sequence n T for 0,1, k =  of sets of trees, where and each T by the application of a tableau rule (see Figure 4).We also use additional rules for other connectives in practice, but they amount to simple combinations of the basic rules shown here.

{ (
, where is a literal, , and , for all then add , to : if , , where is a literal, , and , for all then add , to The rule ( ) RP states that all literals that depend on an action in a context that does not verify have to be propagated following the execution of that action.

Rule ( )
RB is a back-propagation rule, which is required for completeness of the tableau method, and it states that literals that are true but whose truth value was not changed from the parent node in the tree must also have been true in the parent node.See [29] and [28] for further details.
Space precludes a full account of our test implementation; our system is in the pure functional language Haskell.We use a straightforward algebraic type for representing formulas, and labeled formulas are represented using a simple type synonym.The ordering of the clauses is important: formulas causing tableau branching are lower in the definition, which means that the ordering on formulas that the compiler generates by declaring the type to be an instance of "Ord" is used to prioritize reduction rule application to push branching towards the lower part of the tableau.
data LAPFormula = F|T|Atom String|Not LAPFormula And Formula |Necessary LAPFormula|Possible LAPformula |Cause String Formula... deriving (Eq, Ord) type Formula = (Int, Formula) Space precludes a complete account of our test implementation, so we offer an abbreviated description focussing on the core components.In addition to the tableau evaluation module, we also have parser modules, and a number of supporting data structures particularly for representing skeleton relations and dependency relations.The tableau is implemented in operational semantics style, using an algebraic data type to represent a set of abstract operations on tableau branches.As a sample: "Fail" represents an error condition, 'Result' carries a return value, "Get" retrieves a formula for reduction, "Put" adds a labeled formula to the branch where it will be subject to further reduction, "Fresh" generates a new possible world index, "Claim" asserts accessibility between possible worlds under actions, "Close" closes the tableau branch by asserting a contradiction for a given world index, and "Split" forks the tableau into two tableau.
data Tableau u = Fail |Result u |Get (Formula -> Tableau u) |Put Formula (Tableau u) |Fresh (Int -> Tableau u) |Claim (Int, String, Int) (Tableau u) |Close Int (Tableau u) |Split (Tableau u) (Tableau u) ...There are also constructors for other operations such as those for adding labeled literals to a separate list where they will not be subject to further reduction steps, for searching the skeleton relation, and for searching the dependency relations (our implementation actually supports   as well as  ).These operations all follow the same basic pattern as those shown, so we have omitted them for brevity.
instance Monad Tableau where return It is easy to verify that this obeys the left unit, right unit and associativity monad laws.For convenience, we use some simple wrapper functions around the constructors, rather than using them directly.For instance: get :: Tableau Formula get = Get Result put :: Formula -> Tableau () put x = (Put x .Result) () close :: Int -> Tableau () close n = (Close n .Result) () The instantiation of the abstract machine uses a data type that has separate structures for holding labeled formulas that will be subject to further reduction, those that will not be further used to fire rules, the skeleton relation of accessi-bility between possible worlds, and the ternary dependency relation.Here "BBTree" is an ordered tree type that implements the priority relation on formulas, so that non-branching formulas are preferred for reduction over those that cause branching."Skeleton" is an indexed tree structure supporting the various kinds of searches needed on accessibility relation instances, and "Dependency" represents the ternary dependency relation and similarly allows the necessary searches on its instances.
data Branch = Branch { todo :: BBTree Formula , lits :: BBTree Formula , rho :: Skeleton , index :: Int , deps :: Dependency } deriving (Eq, Ord) The central function is the "runTab" function that defines the how the abstract operations should be applied to branch structures.The rest of the cases (not shown) follow the same basic pattern.... The functions "nil" and "singleton" build trees with zero and one element, respectively.The case for 'Put' uses an auxiliary function 'into' that checks first to see if the branch already contains the negation of the formula to be inserted into the branch and, if so, inserts a formula containing contradiction "F" instead.
This approach provides us with a very compact and natural definition for the tableau reduction rules, as illustrated below. 4 .It uses a function "fromN" that returns a list of verbs and world indexes accessible from a given world index, and the standard library "mapM" to map each of these to actions that insert each resulting formula into the branch.A program for the abstract tableau machine for completely expanding a branch is also very simple.
expand :: Tableau () expand = isComplete >>= \c -> if c then return () else get >>= reduce >> reduction Given an initial branch, the tableau can be applied to an initial branch, say b, with runTab expand b.We also have a number of convenience functions for producing an initial branch data structure from a list of formulas and dependency relation instances, and for extracting the results from the resulting tree of closed and saturated branches.Their implementation is straightforward though somewhat tedious.

Conclusions
In this paper, we have presented sophisticated cognitive and meta-cognitive supervisor models for joint swarms of robotic aerial and ground vehicles.Based on the research of the recent Nobel prize in Physiology on path integration and navigation in the mammalian and human hippocampus (briefly reviewed in the appendix), this paper develops a Hamiltonian path integral cognitive supervisor model.This model emulates an ∞ -dimensional neural recurrent neural net- work, yielding attractor fields for robotic swarms.While direct simulation of this Hamiltonian path integral can be done using IBMs's TrueNorth chip, for the purpose of its immediate evaluation on common hardware, we have transformed this into a coupled pair of NLS equations and simulated this in Mathematica.
The central point of our meta-cognitive model is that we are not utilising inference in modal logic systems to determine low-level movement, but rather to simulate a kind of high-level awareness in light of descriptive goals, general conditions and broad actions to make sense of sensor data and guide overall vehicle behaviour.Our representation of meta-cognitive communication using simple atoms and verbs reflects this choice.By effectively delegating details, the relatively simple models are supported by the propositional multi-modal logic  suffice, with decidability of inference and, in practice, reasonable computation costs and fairly compact meta-cognitive behavioural definitions.We plan to supplant our current use of a tableau method for meta-cognitive inference using the multimodal logic  with a new path integral represen- tation; that is, to eventually fully integrate meta-cognition and affine Hamiltonian control into what would amount to a single coherent generalized Hopfield scale at which space is represented increases systematically along the dorsoventral axis in both the hippocampus and the MEC.Spatially periodic inputs (at multiple scales) converging from the MEC-grid cells, result in non-periodic spatial firing of the hippocampal place cells.
The paper [3] reviews how place cells and grid cells form the entorhinal-hippocampal representations, initially observed in [46] and mathematically mod- eled in [47] [48], for quantitative spatio-temporal representation of places, routes, and associated experiences during behavior and in memory.
It has been observed that place cells perform both pattern completion and pattern separation, while hippocampal representations cannot always be discontinuous as in a sequential Hopfield network [13], but rather similar to the graded-response Hopfield network [14].
Finally, while all the research mentioned so far was dealing with 2D hippocampal path integration and navigation, which is relevant for our UGVs, in recent years this research has been generalized to 3D navigation of bats in [49] [50].
Submit or recommend next manuscript to SCIRP and we will provide best service for you: Accepting pre-submission inquiries through Email, Facebook, LinkedIn, Twitter, etc.A wide selection of journals (inclusive of 9 subjects, more than 200 journals) Providing 24-hour high-quality service User-friendly online submission system Fair and swift peer-review system Efficient typesetting and proofreading procedure Display of the result of downloads and visits, as well as the number of cited articles Maximum dissemination of your research work Submit your manuscript at: http://papersubmission.scirp.org/Or contact ica@scirp.org

1 For
technical details on the Nobel awarded work of John O'Keefe, May-Britt Moser and Edvard I. Moser, see Appendix and the references therein.

3
Our final step is to transform the N-particle partition function [ ] N k Z J into an infinite-dimensional recurrent neural network (of a generalized Hopfield type) by including the hippocampal synaptic weights ( ) k w τ into it (compare with [12]), as:

Figure 2 .
Figure 2. Density plots corresponding to 3D plots in Figure 1, representing hypothetical attractor fields for robotic swarms.
is true and the action release is executed, then Delivered will be made true.Frame axioms are effect constraints of the form will remain true after action travel is executed if it was true before.Formulae of the form [ ] f υ mean that after performing action υ , condition f will be true, so[ ]release Carrying ¬  says that Carrying is false after executing release, for instance.can also alternate actions υ and ψ depending on the truth or falsity of a current condition f to yield an outcome g using [ ] use the logic  because it includes an extra parameter in the depen- dence relation to capture the conditions under which actions may impact on atoms, thereby avoiding the need to state conditional frame axioms in defining the problem domain.We write the ternary contextual dependence relation as f a υ  , where f is a classical formula, V υ ∈ is a verb and a A ∈ is an atom, to mean that if f is true then action υ may change the truth value of a .Note that weak contextual dependence does not mean that the action in the context causes a change in truth value of the atom, only that the change might happen.For instance, Carrying Delivered release Delivered ¬  ∧ states that executing release when Carrying is true and Delivered is false may effect the value of Delivered; the conditional frame axiom which represents the accessibility relations between possible worlds under actions; we write n m A Tree, which corresponds to a  -model, is a pair ( )

Figure 3 .
Figure 3.A simple theory in  .Note the absence of frame axioms, which we would have in  , and conditional frame axioms we would still need in   .We have ( ) [ ][ ][ ]( ) S K pickup travel release Carrying Delivered ∪ → ¬   ∧ .

Figure 4 .
Figure 4. Tableau rules for  , as a modification of the tableau rules for   , with the final two rules substituted for new rules for handling the ternary dependence relation.The notation ( ) , L n a  means that the literal a cannot be verified in world n from the formulae in L .