# Stéphane Le MénecMBDA · GCN

Stéphane Le Ménec

PhD Nice Sophia-Antipolis University

## About

63

Publications

4,627

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

368

Citations

## Publications

Publications (63)

The problem of intercepting a maneuverable target (evader) by an interceptor (pursuer) is considered using a linearized kinematical model with first-order acceleration dynamics of the interceptor and the target. The robust capture zone of a pursuer’s feedback strategy is the set of all initial positions, from which the capture (zero miss distance)...

This paper develops a novel particle swarm optimiser algorithm. The focus of this study is how to improve the performance of the classical particle swarm optimisation approach, i.e., how to enhance its convergence speed and capacity to solve complex problems while reducing the computational load. The proposed approach is based on an improvement of...

If a pursuit game with many persons can be formalized in the framework of zero-sum differential games, then general methods can be applied to solve it. But difficulties arise connected with very high dimension of the phase vector when there are too many objects. Just due to this problem, special formulations and methods have been elaborated for con...

Viability theory provides a set of concepts and algorithms to study uncertain continuous dynamic systems under viability (or state) constraints. Interval computation is about guaranteed numerical methods for approximating sets. The main tool to be used is based on the idea of enclosing real numbers in intervals and real vectors in boxes. Refined in...

The problem of intercepting a maneuverable target (evader) by an interceptor (pursuer) is considered using a linearized kinematical model with first order acceleration dynamics of the interceptor and the target. The robust capture zone of a pursuer’s feedback strategy is the set of all initial positions, from which the capture (zero miss distance)...

Many mobile robots such as wheeled robots, boats, or plane are described by nonholonomic differential equations. As a consequence, they have to satisfy some differential constraints such as having a radius of curvature for their trajectory lower than a known value. For this type of robots, it is difficult to prove some properties such as the avoida...

This paper proposes an enhanced Particle Swarm Optimisation (PSO) algorithm and examines its performance. In the proposed PSO approach, PSO is combined with Evolutionary Game Theory to improve convergence. One of the main challenges of such stochastic op-timisation algorithms is the difficulty in the theoretical analysis of the convergence and perf...

A linear pursuit-evasion differential game with two pursuers and one evader is considered. The pursuers try to minimize the final miss (an ideal situation is to get exact capture), the evader counteracts them. Two cases are investigated. In the first case, each pursuer is dynamically stronger than the evader, in the second one, they are weaker. Res...

This paper addresses the problem of cooperative allocation strategies and guidance laws in scenarios involving N pursuers against M evaders. The pursuer assignment strategies are based on capturablity feature considerations. The attainability / reachability characteristics are computed using 1×1 and 2×1 differential game no escape zones. This appro...

The work deals with a differential game with two pursuers and one evader. Dynamics of each object is described by a stationary linear system of a general type with a scalar control. The payoff is the minimum of two one-dimensional misses between the first pursuer and the evader and between the second pursuer and the evader. The misses are calculate...

This paper proposes an enhanced Particle Swarm Optimisation (PSO) algorithm and examines its performance. In the proposed PSO approach, PSO is combined with Evolutionary Game Theory to improve convergence. One of the main challenges of such stochastic optimisation algorithms is the difficulty in the theoretical analysis of the convergence and perfo...

This paper proposes an enhanced Particle Swarm Optimisation (PSO) algorithm and examines its performance. In the proposed PSO approach, PSO is combined with Evolutionary Game Theory to improve convergence. One of the main challenges of such stochastic op-timisation algorithms is the difficulty in the theoretical analysis of the convergence and perf...

Three objects move in a straight line: two pursuers (with identical dynamics) and one evader. All the objects have linear dynamics. The first player joins the pursuers. The second one is the evader. At a prescribed termination instant, one measures the distances between the evader and both pursuers. The minimum of these two distances is taken as th...

We consider an antagonistic differential game where the first player controls the actions of two pursuers that aim to minimize, at a given time instant their miss with respect to an evader. The second (maximizing) player is identified with the evader. We study the case when dynamic capabilities of pursuers are less than the capabilities of the evad...

Many mobile robots such as wheeled robots, boats, or plane are described by nonholonomic differential equations. As a consequence, they have to satisfy some differential constraints such as having a radius of curvature for their trajectory lower than a known value. For this type of robots, it is difficult to prove some properties such as the avoida...

An algorithm for numerical constructing level sets of the value function is shortly described for one class of linear differential games with fixed termination instant. Some model interception problems with one target and two interceptors are considered; all objects are weak maneuverable.

This paper develops a novel multi-objective optimisation method based on the Evolutionary Game Theory to solve Weapon Target Assignment problems in real-time. The main research question of this study was how to consider multi-objective functions all together and choose a best solution among many possible non-dominant optimal solutions. The key idea...

Works by J.Shinar and his pupils [1,2] deal with interception problems in high layers of atmosphere that are formalized as linear differential games with fixed termination instant. In these works, there are analytic investigation of effect of servomechanism dynamics on the structure of the solvability sets of the game. These sets are built in two-d...

This paper proposes to reduce the computational time of an algorithm based on the combination of the Evolutionary Game Theory (EGT) and the Particle Swarm Optimisation (PSO), named C-EGPSO, by using Neural Networks (NN) in order to lighten the computation of the identified heavy part of the C-EGPSO. This computationally burdensome task is the resol...

This project proposes a centralised algorithm to design cooperative allocation strategies and guidance laws for air defence applications. Scenarios in naval and ground context have been defined for performance analysis by comparison to a benchmark target allocation policy. The cooperative target allocation algorithm is based on the following featur...

The paper deals with a differential game with two pursuers and one evader. Dynamics of each object is described by a stationary linear system of a general type with a scalar control. The payoff is the minimum of two one-dimensional misses between the first pursuer and the evader and between the second pursuer and the evader. The misses are calculat...

This paper deals with a zero-sum differential game, in which the first player controls two pursuing objects, whose aim is to minimize the minimum of the misses between each of them and the evader at some given instant. The case is studied when the pursuers have equal dynamic capabilities, but are less powerful than the evader. The first player’s co...

This paper is dealing with a team of autonomous vehicles using on-board sensors for tracking and intercepting a moving target. The team of autonomous vehicles is composed of a pursuing vehicle and of several Unmanned Aircraft Vehicles (UAVs). The on-board sensors we talk about have limited capabilities in terms of range. Before acquiring the target...

In this paper, dynamic weapon target assignment is proposed for area air defence. The focus of this study is to optimally protect a convoy of friendly assets from oncoming targets whose manoeuvres are hard to be predicted. The earliest geometry provides a boundary of the intercept region without prediction of target manoeuvre. If any of friendly as...

During the mid-course phase of an air-to-air missile, choosing the optimal Guidance Point (GP) so as to maximize lock-on success and minimize intercept time is critical. Given low computational resources available on board and a very constrained maneuvering time frame, GP-based algorithms must be efficient. We suggest an innovative approach using R...

The paper deals with a problem of pursuit-evasion with two pursuers and one evader having linear dynamics. The pursuers try to minimize the final miss (an ideal situation is to get exact capture), the evader counteracts them. Results of numerical construction of level sets (Lebesgue sets) of the value function are given. A feedback method for produ...

This project proposes an innovative algorithm for designing target allocation strategies and missile guidance laws for air defense applications. This algorithm is localized in the control station of the area to protect; i.e. runs in a centralized manner. It has been optimized according to cooperative principles in a way to increase the defense team...

Mots-clés : Optimisation par essaim particulaire, Théorie des jeux évolutionnaires, Stratégie évo-lutionnairement stable

Technology developments in the field of modular data links may allow the creation of a multi-link communication network to be established between anti-air missiles and the launch platform. The future prospect of such ad hoc networks with many existing guidance and allocation schemes makes it possible to consider cooperative strategies for the air d...

We study a model differential zero-sum game, which can be regarded as an idealized variant of the final stage of a space pursuit, in which two pursuing objects and one evader are involved. Results of numeric constructions of level sets of the value function for qualitatively different cases of the game parameters and results of simulation of optima...

During the mid-course phase of an air-to-air missile, choosing the optimal Guidance Point (GP) so as to maximize lock-on success and minimize intercept time is critical. Given low computational resources available on board and a very constrained maneuvering time frame, GP-based algorithms must be efficient. We suggest an innovative approach using R...

An antagonistic differential game is considered where motion occurs in a straight line. Deviations between the first and second pursuers and the evader are computed at the instants T
1 and T
2, respectively. The pursuers act in coordination. Their aim is to minimize the resultant miss, which is equal to the minimum of the deviations happened at the...

Mots-clés : Weapon Target Assignment, optimisation par essaim particulaire, théorie des jeux évolutionnaires, théorie des jeux, replicator, BNN, logit, Meilleure Réponse

This paper addresses an allocation problem and proposes a solution using a swarm intelligence method. The application of swarm intelligence has to be discrete. This allocation problem can be modelled as a multi-objective optimization problem where the authors minimize the time and the distance of the total travel in a logistic context. This study u...

Mots-clés : Weapon Target Assignment, optimisation par essaim particulaire, théorie des jeux évolutionnaires, théorie des jeux, replicator, BNN, logit, Meilleure Réponse

We study the situation involving two pursuers and one evader in the framework of DGL/1 (Linear Differential Game with bounded
controls and first order dynamics for both players). The criterion of the one-on-one DGL/1 game is the terminal miss distance
(perpendicular to the initial pursuer/evader Line Of Sight). The pursuer is minimizing this outcom...

This project proposes a centralized algorithm to design cooperative allocation strategies and guidance laws for air defense applications. Scenarios in naval and ground context have been defined for performance analysis by comparison to a benchmark target allocation policy. The cooperative target allocation algorithm is based on the following featur...

In this paper, a cooperative mid course missile guidance law is proposed by using Earliest Intercept Geometry (EIG) concept and the optimal control theory for area air defence. In the cooperative mid course guidance problem, since there are many attacking and defending missiles, how to allocate the defending missiles to the attacking missiles is on...

In this paper, we proposed a cooperative guidance strategy to consider many on many engagements for maritime area air defence. The main idea is that a cooperative missile guidance law can defend the area as long as it guarantees that the keep out zone is always within the defended area defined by Earliest Intercept Geometry (EIG) or a No Escape Zon...

Mid-course guidance phase classically refers to the procedure guiding the missile to a terminal handover point in order to acquire the target motion through its on-board sensor. The mid-course guidance law differs significantly from the guidance logic for the terminal homing phase due to the inherited characteristic of the midcourse guidance: it mu...

Mid-course guidance phase classically refers to the procedure guiding the missile to a terminal handover point in order to acquire the target motion through its on-board sensor. The mid-course guidance law differs significantly from the guidance logic for the terminal homing phase due to the inherited characteristic of the midcourse guidance: it mu...

This chapter deals with air-to-air missile guidance law design. We model the terminal engagement of a ramjet missile with
radar seeker lock on a single target (generic aircraft). We consider a realistic interception simulation with measurement
errors and, more particularly, radome aberration errors.We define an extended Kalman filter to compensate...

A horizontal pursuit-evasion game of degree (with capture time as criterion) between a coasting missile and a maneuvering target of constant speed is considered. This game is the quantitative version of a qualitative one (game of kind with capture or no capture as binary criterion) previously studied by J. Shinar and Co-authors. The optimal strateg...

A solution using neural networks for the problem of the choice of the control mode of a missile is proposed and implemented. The test on 7000 interceptions shows that this approach makes it possible to reduce the number of failures (miss distance larger than 5 meters) compared to the use of expert rules.

The improvement of guidance possibilities of medium range missiles
with new missiles like the Mica/Amraam increases the number of phases in
aerial duels and implies more complex shooting and escape strategies.
Therefore we are interested in developing algorithmic methods to study
these new duels, which are difficult to study merely with the classic...

The improvement of guidance possibilities of medium range missiles with new missiles like the Mica/Amraam1 increases the number of phases in aerial duels and implies more complex firing and escape strategies. Therefore we are interested in developing algorithmic methods to study these new duels, which are difficult to study merely with the classica...

Le developpement de nouveaux missiles a moyenne distance du type Mica/Araam accroit le nombre de phases d'un duel aerien et introduit de nouvelles strategies de tir et d'evasion plus complexes. Nous presentons d'abord les duels a moyenne distance avant de les etudier sous la forme de sous-jeux differentiels. Puis nous expliquons comment developper...

Disponible dans les fichiers attachés à ce document

The aim of this work is to increase the effectiveness of proportional navigation guidance type laws by avoiding the pursuer to cross the barrier of the corresponding pursuit evasion game from the capture zone to the no capture zone. Using a guidance law scheduling system based on expert system rules, we propose to hybrid an optimal pursuit strategy...

A problem of pursuit-evasion with two pursuers and one evader is studied. The formulation of the problem was suggested in Le Ménec (2008, 2010). In that work, some cases were solved by analytic methods. This paper deals with the problem by means of numerical construction of solvability sets. Variants of the game are considered where application of...