References of "Danoy, Grégoire 50001463"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailMO-Gym: A Library of Multi-Objective Reinforcement Learning Environments
Alegre, Lucas Nunes; Felten, Florian UL; Talbi, El-Ghazali UL et al

Scientific Conference (2022, November)

Detailed reference viewed: 55 (15 UL)
Full Text
Peer Reviewed
See detailAn Evolutionary Algorithm to Optimise a Distributed UAV Swarm Formation System
Stolfi Rosso, Daniel UL; Danoy, Grégoire UL

in Applied Sciences (2022), 12(20),

In this article, we present a distributed robot 3D formation system optimally parameterised by a hybrid evolutionary algorithm (EA) in order to improve its efficiency and robustness. To achieve that, we ... [more ▼]

In this article, we present a distributed robot 3D formation system optimally parameterised by a hybrid evolutionary algorithm (EA) in order to improve its efficiency and robustness. To achieve that, we first describe the novel distributed formation algorithm3 (DFA3), the proposed EA, and the two crossover operators to be tested. The EA hyperparameterisation is performed by using the irace package and the evaluation of the three case studies featuring three, five, and ten unmanned aerial vehicles (UAVs) is performed through realistic simulations by using ARGoS and ten scenarios evaluated in parallel to improve the robustness of the configurations calculated. The optimisation results, reported with statistical significance, and the validation performed on 270 unseen scenarios show that the use of a metaheuristic is imperative for such a complex problem despite some overfitting observed under certain circumstances. All in all, the UAV swarm self-organised itself to achieve stable formations in 95% of the scenarios studied with a plus/minus ten percent tolerance. [less ▲]

Detailed reference viewed: 14 (0 UL)
Full Text
Peer Reviewed
See detailOptimising Autonomous Robot Swarm Parameters for Stable Formation Design
Stolfi Rosso, Daniel UL; Danoy, Grégoire UL

in Proceedings of the Genetic and Evolutionary Computation Conference (2022, July 08)

Autonomous robot swarm systems allow to address many inherent limitations of single robot systems, such as scalability and reliability. As a consequence, these have found their way into numerous ... [more ▼]

Autonomous robot swarm systems allow to address many inherent limitations of single robot systems, such as scalability and reliability. As a consequence, these have found their way into numerous applications including in the space and aerospace domains like swarm-based asteroid observation or counter-drone systems. However, achieving stable formations around a point of interest using different number of robots and diverse initial conditions can be challenging. In this article we propose a novel method for autonomous robots swarms self-organisation solely relying on their relative position (angle and distance). This work focuses on an evolutionary optimisation approach to calculate the parameters of the swarm, e.g. inter-robot distance, to achieve a reliable formation under different initial conditions. Experiments are conducted using realistic simulations and considering four case studies. The results observed after testing the optimal configurations on 72 unseen scenarios per case study showed the high robustness of our proposal since the desired formation was always achieved. The ability of self-organise around a point of interest maintaining a predefined fixed distance was also validated using real robots. [less ▲]

Detailed reference viewed: 14 (1 UL)
Full Text
Peer Reviewed
See detailFrom communities to protein complexes: A local community detection algorithm on PPI networks
Dilmaghani, Saharnaz; Brust, Mathias UL; Ribeiro, Carlos H. et al

in PLoS ONE (2022), 17(1), 1-17

Detailed reference viewed: 41 (3 UL)
Full Text
Peer Reviewed
See detailA RNN-Based Hyper-Heuristic for Combinatorial Problems
Kieffer, Emmanuel UL; Duflo, Gabriel UL; Danoy, Grégoire UL et al

in A RNN-Based Hyper-Heuristic for Combinatorial Problems (2022)

Designing efficient heuristics is a laborious and tedious task that generally requires a full understanding and knowledge of a given optimization problem. Hyper-heuristics have been mainly introduced to ... [more ▼]

Designing efficient heuristics is a laborious and tedious task that generally requires a full understanding and knowledge of a given optimization problem. Hyper-heuristics have been mainly introduced to tackle this issue and are mostly relying on Genetic Programming and its variants. Many attempts in the literature have shown that an automatic training mechanism for heuristic learning is possible and can challenge human-based heuristics in terms of gap to optimality. In this work, we introduce a novel approach based on a recent work on Deep Symbolic Regression. We demonstrate that scoring functions can be trained using Recurrent Neural Networks to tackle a well-know combinatorial problem, i.e., the Multi-dimensional Knapsack. Experiments have been conducted on instances from the OR-Library and results show that the proposed modus operandi is an alternative and promising approach to human- based heuristics and classical heuristic generation approaches. [less ▲]

Detailed reference viewed: 79 (10 UL)
Full Text
Peer Reviewed
See detailLearning to Optimise a Swarm of UAVs
Duflo, Gabriel UL; Danoy, Grégoire UL; Talbi, El-Ghazali UL et al

in Applied Sciences (2022), 12(19 9587),

The use of Unmanned Aerial Vehicles (UAVs) has shown a drastic increase in interest in the past few years. Current applications mainly depend on single UAV operations, which face critical limitations such ... [more ▼]

The use of Unmanned Aerial Vehicles (UAVs) has shown a drastic increase in interest in the past few years. Current applications mainly depend on single UAV operations, which face critical limitations such as mission range or resilience. Using several autonomous UAVs as a swarm is a promising approach to overcome these. However, designing an efficient swarm is a challenging task, since its global behaviour emerges solely from local decisions and interactions. These properties make classical multirobot design techniques not applicable, while evolutionary swarm robotics is typically limited to a single use case. This work, thus, proposes an automated swarming algorithm design approach, and more precisely, a generative hyper-heuristic relying on multi-objective reinforcement learning, that permits us to obtain not only efficient but also reusable swarming behaviours. Experimental results on a three-objective variant of the Coverage of a Connected UAV Swarm problem demonstrate that it not only permits one to generate swarming heuristics that outperform the state-of-the-art in terms of coverage by a swarm of UAVs but also provides high stability. Indeed, it is empirically demonstrated that the model trained on a certain class of instances generates heuristics and is capable of performing well on instances with a different size or swarm density. [less ▲]

Detailed reference viewed: 30 (1 UL)
Full Text
Peer Reviewed
See detailMORL/D: Multi-Objective Reinforcement Learning based on Decomposition
Felten, Florian UL; Talbi, El-Ghazali UL; Danoy, Grégoire UL

in International Conference in Optimization and Learning (OLA2022) (2022)

Detailed reference viewed: 89 (15 UL)
Full Text
Peer Reviewed
See detailSuSy-EnGaD: Surveillance System Enhanced by Games of Drones
Stolfi Rosso, Daniel UL; Brust, Mathias UL; Danoy, Grégoire UL et al

in Drones (2022), 6(13),

In this article, we propose SuSy-EnGaD, a surveillance system enhanced by games of drones. We propose three different approaches to optimise a swarm of UAVs for improving intruder detection, two of them ... [more ▼]

In this article, we propose SuSy-EnGaD, a surveillance system enhanced by games of drones. We propose three different approaches to optimise a swarm of UAVs for improving intruder detection, two of them featuring a multi-objective optimisation approach, while the third approach relates to the evolutionary game theory where three different strategies based on games are proposed. We test our system on four different case studies, analyse the results presented as Pareto fronts in terms of flying time and area coverage, and compare them with the single-objective optimisation results from games. Finally, an analysis of the UAVs trajectories is performed to help understand the results achieved. [less ▲]

Detailed reference viewed: 52 (11 UL)
Full Text
Peer Reviewed
See detailA Framework of Hyper-Heuristics based on Q-Learning
Duflo, Gabriel UL; Danoy, Grégoire UL; Talbi, El-Ghazali UL et al

in International Conference in Optimization and Learning (OLA2022) (2022)

Detailed reference viewed: 78 (2 UL)
Full Text
Peer Reviewed
See detailImproving Pheromone Communication for UAV Swarm Mobility Management
Stolfi Rosso, Daniel UL; Brust, Mathias UL; Danoy, Grégoire UL et al

in ICCCI 2021: Computational Collective Intelligence (2021, July 30)

In this article we address the optimisation of pheromone communication used for the mobility management of a swarm of Unmanned Aerial Vehicles (UAVs) for surveillance applications. A genetic algorithm is ... [more ▼]

In this article we address the optimisation of pheromone communication used for the mobility management of a swarm of Unmanned Aerial Vehicles (UAVs) for surveillance applications. A genetic algorithm is proposed to optimise the exchange of pheromone maps used in the CACOC (Chaotic Ant Colony Optimisation for Coverage) mobility model which improves the vehicles’ routes in order to achieve unpredictable trajectories as well as maximise area coverage. Experiments are conducted using realistic simulations, which additionally permit to assess the impact of packet loss ratios on the performance of the surveillance system, in terms of reliability and area coverage. [less ▲]

Detailed reference viewed: 18 (0 UL)
Full Text
Peer Reviewed
See detailSwarm-based counter UAV defense system
Brust, Matthias R. UL; Danoy, Grégoire UL; Stolfi Rosso, Daniel UL et al

in Discover Internet of Things (2021), 1(1),

Unmanned Aerial Vehicles (UAVs) have quickly become one of the promising Internet-of-Things (IoT) devices for smart cities. Thanks to their mobility, agility, and onboard sensors'customizability, UAVs ... [more ▼]

Unmanned Aerial Vehicles (UAVs) have quickly become one of the promising Internet-of-Things (IoT) devices for smart cities. Thanks to their mobility, agility, and onboard sensors'customizability, UAVs have already demonstrated immense potential for numerous commercial applications. The UAVs expansion will come at the price of a dense, high-speed and dynamic traffic prone to UAVs going rogue or deployed with malicious intent. Counter UAV systems (C-UAS) are thus required to ensure their operations are safe. Existing C-UAS, which for the majority come from the military domain, lack scalability or induce collateral damages. This paper proposes a C-UAS able to intercept and escort intruders. It relies on an autonomous defense UAV swarm, capable of self-organizing their defense formation and to intercept the malicious UAV. This fully localized and GPS-free approach follows a modular design regarding the defense phases and it uses a newly developed balanced clustering to realize the intercept- and capture-formation. The resulting networked defense UAV swarm is resilient to communication losses. Finally, a prototype UAV simulator has been implemented. Through extensive simulations, we demonstrate the feasibility and performance of our approach. [less ▲]

Detailed reference viewed: 78 (15 UL)
Full Text
Peer Reviewed
See detailA Distributed Pareto-based Path Planning Algorithm for Autonomous Unmanned Aerial Vehicles (Extended Abstract)
Samir Labib, Nader UL; Danoy, Grégoire UL; Brust, Matthias R. UL et al

Scientific Conference (2021, January 07)

Autonomous Unmanned Aerial Vehicles (UAVs) are in increasing demand thanks to their applicability in a wide range of domains. However, to fully exploit such potential, UAVs should be capable of ... [more ▼]

Autonomous Unmanned Aerial Vehicles (UAVs) are in increasing demand thanks to their applicability in a wide range of domains. However, to fully exploit such potential, UAVs should be capable of intelligently planning their collision-free paths as that impacts greatly the execution quality of their applications. While being a problem well addressed in literature, most presented solutions are either computationally complex centralised approaches or ones not suitable for the multiobjective requirements of most UAV use-cases. This extended abstract introduces ongoing research on a novel distributed Pareto path planning algorithm incorporating a dynamic multi-criteria decision matrix allowing each UAV to plan its collision-free path relying on local knowledge gained via digital stigmergy. The article presents some initial simulations results of a distributed UAV Traffic Management system (UTM) on a weighted multilayer network. [less ▲]

Detailed reference viewed: 213 (42 UL)
Full Text
Peer Reviewed
See detailUAV-UGV-UMV Multi-Swarms for Cooperative Surveillance
Stolfi Rosso, Daniel UL; Brust, Matthias R. UL; Danoy, Grégoire UL et al

in Frontiers in Robotics and AI (2021), 8

In this paper we present a surveillance system for early detection of escapers from a restricted area based on a new swarming mobility model called CROMM-MS (Chaotic Rössler Mobility Model for Multi ... [more ▼]

In this paper we present a surveillance system for early detection of escapers from a restricted area based on a new swarming mobility model called CROMM-MS (Chaotic Rössler Mobility Model for Multi-Swarms). CROMM-MS is designed for controlling the trajectories of heterogeneous multi-swarms of aerial, ground and marine unmanned vehicles with important features such as prioritising early detections and success rate. A new Competitive Coevolutionary Genetic Algorithm (CompCGA) is proposed to optimise the vehicles’ parameters and escapers’ evasion ability using a predator-prey approach. Our results show that CROMM-MS is not only viable for surveillance tasks but also that its results are competitive in regard to the state-of-the-art approaches. [less ▲]

Detailed reference viewed: 83 (5 UL)
Full Text
Peer Reviewed
See detailCONSOLE: intruder detection using a UAV swarm and security rings
Stolfi, Daniel H.; Brust, Matthias R. UL; Danoy, Grégoire UL et al

in Swarm Intelligence (2021), 15(3), 205--235

Detailed reference viewed: 57 (6 UL)
Full Text
Peer Reviewed
See detailA competitive Predator–Prey approach to enhance surveillance by UAV swarms
Stolfi, Daniel H.; Brust, Matthias R. UL; Danoy, Grégoire UL et al

in Applied Soft Computing (2021), 111

In this paper we present the competitive optimisation of a swarm of Unmanned Aerial Vehicles (UAV) protecting a restricted area from a number of intruders following a Predator–Prey approach. We propose a ... [more ▼]

In this paper we present the competitive optimisation of a swarm of Unmanned Aerial Vehicles (UAV) protecting a restricted area from a number of intruders following a Predator–Prey approach. We propose a Competitive Coevolutionary Genetic Algorithm (CompCGA) which optimises the parameters of the UAVs (i.e. predators) to maximise the detection of intruders, while the parameters of the intruders (i.e. preys) are optimised to maximise their intrusion success rate. Having chosen the CACOC (Chaotic Ant Colony Optimisation for Coverage) as the base mobility model for the UAVs, we propose an improved new version, where its behaviour is modified by identifying and optimising new parameters to improve the overall success rate when detecting intruders. Six case studies have been optimised using simulations by performing 30 independent runs (180 in total) of our CompCGA. Finally, we conducted a series of master tournaments (1,800,000 evaluations) using the best specimens obtained from each run and case study to test the robustness of our proposed approach against unexpected intruders. Our surveillance system improved the average percentage of intruders detected with respect to CACOC by a maximum of 126%. More than 90% of intruders were detected on average when using a swarm of 16 UAVs while CACOC’s detection rates are always under 80% in all cases. [less ▲]

Detailed reference viewed: 48 (4 UL)
Full Text
Peer Reviewed
See detailA Q-Learning Based Hyper-Heuristic for Generating Efficient UAV Swarming Behaviours
Duflo, Gabriel UL; Danoy, Grégoire UL; Talbi, El-Ghazali UL et al

in Intelligent Information and Database Systems - 13th Asian Conference ACIIDS 2021, Phuket, Thailand, April 7-10, 2021, Proceedings (2021)

Detailed reference viewed: 52 (6 UL)
Full Text
Peer Reviewed
See detailOptimising pheromone communication in a UAV swarm
Stolfi, Daniel H.; Brust, Matthias R. UL; Danoy, Grégoire UL et al

in GECCO '21: Genetic and Evolutionary Computation Conference, Companion Volume, Lille, France, July 10-14, 2021 (2021)

Detailed reference viewed: 44 (2 UL)
Full Text
Peer Reviewed
See detailImproving Pheromone Communication for UAV Swarm Mobility Management
Stolfi, Daniel H.; Brust, Matthias R. UL; Danoy, Grégoire UL et al

in 13th International Conference on Computational Collective Intelligence (ICCCI 2021) (2021)

Detailed reference viewed: 43 (6 UL)
Full Text
Peer Reviewed
See detailCommunity Detection in Complex Networks: A Survey on Local Approaches
Esmaeilzadeh Dilmaghani, Saharnaz UL; Brust, Matthias R. UL; Danoy, Grégoire UL et al

Scientific Conference (2021)

Early approaches of community detection algorithms often depend on the network’s global structure with a time complexity correlated to the network size. Local algorithms emerged as a more efficient ... [more ▼]

Early approaches of community detection algorithms often depend on the network’s global structure with a time complexity correlated to the network size. Local algorithms emerged as a more efficient solution to deal with large-scale networks with millions to billions of nodes. This methodology has shifted the attention from global structure towards the local level to deal with a network using only a portion of nodes. Investigating the state-of-the-art, we notice the absence of a standard definition of locality between community detection algorithms. Different goals have been explored under the local terminology of community detection approaches that can be misunderstood. This paper probes existing contributions to extract the scopes where an algorithm performs locally. Our purpose is to interpret the concept of locality in community detection algorithms. We propose a locality exploration scheme to investigate the concept of locality at each stage of an existing community detection workflow. We summarized terminologies concerning the locality in the state-of-the-art community detection approaches. In some cases, we observe how different terms are used for the same concept. We demonstrate the applicability of our algorithm by providing a review of some algorithms using our proposed scheme. Our review highlights a research gap in community detection algorithms and initiates new research topics in this domain. [less ▲]

Detailed reference viewed: 245 (26 UL)