== Abstract ==

​

The probability of conflict between two aircraft is calculated by modeling aircraft motion as a deterministic trajectory plus a (scaled) Brownian motion perturbation. In this formalism, the probability of conflict becomes the probability that a Brownian motion escapes from a time-varying safe region. Approximate expressions for the probability of conflict are obtained in closed form for both the finite and infinite horizon cases. Based on these expressions, an autonomous algorithm is proposed for decentralized conflict resolution. The algorithm generalizes potential field ideas to path planning in a highly dynamic environment.

​

​

== Original document ==

​

The different versions of the original document can be found in:

​

* [http://www.cs.berkeley.edu/~sastry/pubs/OldSastryALL/HuAircraftConflict1999.pdf http://www.cs.berkeley.edu/~sastry/pubs/OldSastryALL/HuAircraftConflict1999.pdf]

​

* [http://robotics.eecs.berkeley.edu/~sastry/pubs/OldSastryALL/HuAircraftConflict1999.pdf http://robotics.eecs.berkeley.edu/~sastry/pubs/OldSastryALL/HuAircraftConflict1999.pdf],

: [https://ieeexplore.ieee.org/document/831291 https://ieeexplore.ieee.org/document/831291],

: [http://robotics.eecs.berkeley.edu/~sastry//pubs/OldSastryALL/HuAircraftConflict1999.pdf http://robotics.eecs.berkeley.edu/~sastry//pubs/OldSastryALL/HuAircraftConflict1999.pdf],

: [https://academic.microsoft.com/#/detail/1825590931 https://academic.microsoft.com/#/detail/1825590931]

​

* [http://xplorestaging.ieee.org/ielx5/6713/18008/00831291.pdf?arnumber=831291 http://xplorestaging.ieee.org/ielx5/6713/18008/00831291.pdf?arnumber=831291],

: [http://dx.doi.org/10.1109/cdc.1999.831291 http://dx.doi.org/10.1109/cdc.1999.831291]

​