Formal Verification of Conflict Detection Algorithms for Arbitrary Trajectories
نویسندگان
چکیده
This paper presents an approach for developing formally verifiable conflict detection algorithms for aircraft flying arbitrary, nonlinear trajectories. The approach uses a multivariate polynomial global optimization algorithm based on Bernstein polynomials. Since any continuous function on a closed interval, such as an aircraft trajectory within a closed interval of time, can be uniformly approximated by a Bernstein polynomial, this global optimization algorithm can be used to define conflict detection algorithms for arbitrarily complicated trajectories. Conflict detection algorithms developed using this approach can be formally verified in a mechanical theorem prover. This represents an improvement over standard approaches to conflict detection for complex trajectories that essentially search for conflicts by testing many future states and are therefore not guaranteed to detect a given conflict. The proposed approach is illustrated with a formally verified conflict detection algorithm.
منابع مشابه
A Formally Verified Conflict Detection Algorithm for Polynomial Trajectories
In air traffic management, conflict detection algorithms are used to determine whether or not aircraft are predicted to lose horizontal and vertical separation minima within a time interval assuming a trajectory model. In the case of linear trajectories, conflict detection algorithms have been proposed that are both complete, i.e., they detect all conflicts, and sound, i.e., they do not present...
متن کاملConflict Detection and Resolution for 1 , 2 , . . . , N Aircraft Gilles
Formal methods in computer science refers to the use of logic and mathematics to verify that a system design and its implementation satisfy functional requirements and safety properties. Despite the fact that several Conflict Detection and Resolution (CD&R) systems have been proposed in the past few years, very few of these systems have been described and analyzed using formal methods. Therefor...
متن کاملA model for specification, composition and verification of access control policies and its application to web services
Despite significant advances in the access control domain, requirements of new computational environments like web services still raise new challenges. Lack of appropriate method for specification of access control policies (ACPs), composition, verification and analysis of them have all made the access control in the composition of web services a complicated problem. In this paper, a new indepe...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملFormal Verification of Air Traffic Conflict Prevention Bands Algorithms
In air traffic management, a pairwise conflict is a predicted loss of separation between two aircraft, referred to as the ownship and the intruder. A conflict prevention bands system computes ranges of maneuvers for the ownship that characterize regions in the airspace that are either conflict-free or “don’t go” zones that the ownwhip has to avoid. Conflict prevention bands are surprisingly dif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Reliable Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 2012