Julien Lepagnot

Julien Lepagnot

Auto-generated profile, based on publicly available information

Julien Lepagnot

Université de Haute-Alsace, IRIMAS UR 7499, Mulhouse, France

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 July 2024 in RAIRO - Operations Research
Verified
Journal Article
Open access
PDF file
SGSoheila Ghambari
Soheila Ghambari
Mahmoud GolabiMahmoud Golabi
Mahmoud Golabi
LJLaetitia Jourdan
Laetitia Jourdan
JLJulien Lepagnot
Julien Lepagnot
LILhassane Idoumghar
Lhassane Idoumghar
Unmanned Aerial Vehicles (UAVs) are ideally suited for many real-world applications ranging from scientific to commercial, industrial, and military fields. Enhancing the efficiency of UAV-based missions through optimization techniques is of paramount significance. In this regard, the path planning problem that refers to finding the best collision-free path between the start point and the destination by addressing temporal, physical, and geometric constraints is a key issue. In this paper, a review of recent path planning methods from different perspectives with a clear and comprehensive categorization is presented. This study provides a general taxonomy categorizing the existing works into classical approaches, soft-computing techniques, and hybrid methods. Here, a detailed analysis of the recent techniques as well as their advantages and limitations is offered. Additionally, it provides an overview of environment modeling methods, path structures, optimality criteria, completeness criteria, and current UAV simulators.

1 November 2019 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
HRHojjat Rakhshani
Hojjat Rakhshani
LILhassane Idoumghar
Lhassane Idoumghar
JLJulien Lepagnot
Julien Lepagnot
MBMathieu Brévilliers
Mathieu Brévilliers

1 November 2020
Verified
Conference Paper
Closed access
SGSoheila Ghambari
Soheila Ghambari
Mahmoud GolabiMahmoud Golabi
Mahmoud Golabi
JLJulien Lepagnot
Julien Lepagnot
MBMathieu Brévilliers
Mathieu Brévilliers
LJLaetitia Jourdan
Laetitia Jourdan
LILhassane Idoumghar
Lhassane Idoumghar
This paper considers multiobjective UAV path planning in a real 3D environment with the objective to find a safe energy-efficient path. An Enhanced Non-dominated Sorting Genetic Algorithm-II, called ENSGA-II, is proposed and combines several sorts of heuristic information to customize crossover and mutation operators. Furthermore, a local search and a ranking-based roulette wheel selection are incorporated for the mating procedure. Experiment results confirm that ENSGA-II has a better convergence rate and spread of solutions on several new real-world datasets. The effectiveness of the local search component is also validated on the CrazyS robot operating system (ROS) package which consists of a pelican quadcopter's modeling.

24 January 2024 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
MSMuhammad Sulaman
Muhammad Sulaman
Mahmoud GolabiMahmoud Golabi
Mahmoud Golabi
MEMokhtar Essaid
Mokhtar Essaid
JLJulien Lepagnot
Julien Lepagnot
MBMathieu Brévilliers
Mathieu Brévilliers
LILhassane Idoumghar
Lhassane Idoumghar

12 November 2018 in Journal of Systems and Information Technology
Verified
Journal Article
Closed access
MBMathieu Brévilliers
Mathieu Brévilliers
JLJulien Lepagnot
Julien Lepagnot
LILhassane Idoumghar
Lhassane Idoumghar
MRMaher Rebai
Maher Rebai
JKJulien Kritter
Julien Kritter
Purpose: This paper aims to investigate to what extent hybrid differential evolution (DE) algorithms can be successful in solving the optimal camera placement problem.Design/methodology/approach: This problem is stated as a unicost set covering problem (USCP) and 18 problem instances are defined according to practical operational needs. Three methods are selected from the literature to solve these instances: a CPLEX solver, greedy algorithm and row weighting local search (RWLS). Then, it is proposed to hybridize these algorithms with two hybrid DE approaches designed for combinatorial optimization problems. The first one is a set-based approach (DEset) from the literature. The second one is a new similarity-based approach (DEsim) that takes advantage of the geometric characteristics of a camera to find better solutions.Findings: The experimental study highlights that RWLS and DEsim-CPLEX are the best proposed algorithms. Both easily outperform CPLEX, and it turns out that RWLS performs better on one class of problem instances, whereas DEsim-CPLEX performs better on another class, depending on the minimal resolution needed in practice.Originality/value: Up to now, the efficiency of RWLS and the DEset approach has been investigated only for a few problems. Thus, the first contribution is to apply these methods for the first time in the context of camera placement. Moreover, new hybrid DE algorithms are proposed to solve the optimal camera placement problem when stated as a USCP. The second main contribution is the design of the DEsim approach that uses the distance between camera locations to fully benefit from the DE mutation scheme.

1 February 2018 in International Journal of Modeling and Optimization
Verified
Journal Article
Closed access
MBMathieu Brévilliers
Mathieu Brévilliers
JLJulien Lepagnot
Julien Lepagnot
JKJulien Kritter
Julien Kritter
LILhassane Idoumghar
Lhassane Idoumghar