References of "Danoy, Grégoire 50001463"
     in
Bookmark and Share    
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: 29 (1 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: 53 (8 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: 36 (8 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: 25 (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: 57 (14 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: 200 (42 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: 237 (26 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: 36 (6 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: 64 (5 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: 36 (4 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 Intell. (2021), 15(3), 205--235

Detailed reference viewed: 44 (5 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: 43 (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: 36 (2 UL)
Full Text
Peer Reviewed
See detailInnovation Networks from Inter-organizational Research Collaborations
Esmaeilzadeh Dilmaghani, Saharnaz UL; Piyatumrong, Apivadee UL; Danoy, Grégoire UL et al

in Heuristics for Optimization and Learning (2020)

We consider the problem of automatizing network generation from inter-organizational research collaboration data. The resulting networks promise to obtain crucial advanced insights. In this paper, we ... [more ▼]

We consider the problem of automatizing network generation from inter-organizational research collaboration data. The resulting networks promise to obtain crucial advanced insights. In this paper, we propose a method to convert relational data to a set of networks using a single parameter, called Linkage Threshold (LT). To analyze the impact of the LT-value, we apply standard network metrics such as network density and centrality measures on each network produced. The feasibility and impact of our approach are demonstrated by using a real-world collaboration data set from an established research institution. We show how the produced network layers can reveal insights and patterns by presenting a correlation matrix. [less ▲]

Detailed reference viewed: 132 (22 UL)
Full Text
Peer Reviewed
See detailAutomating the Design of Efficient Distributed Behaviours for a Swarm of UAVs
Duflo, Gabriel UL; Danoy, Grégoire UL; Talbi, El-Ghazali UL et al

in IEEE Symposium Series on Computational Intelligence, Canberra 1-4 December 2020 (2020, December)

The usage of Unmanned Aerial Vehicles (UAVs) is gradually gaining momentum for commercial applications. The vast majority considers a single UAV, which comes with several constraints such as its range of ... [more ▼]

The usage of Unmanned Aerial Vehicles (UAVs) is gradually gaining momentum for commercial applications. The vast majority considers a single UAV, which comes with several constraints such as its range of operations or the number of sensors it can carry. Using multiple autonomous UAVs simultaneously as a swarm makes it possible to overcome these limitations. However, manually designing complex emerging behaviours like swarming is a difficult and tedious task especially for such distributed systems which performance is hardly predictable. This article therefore proposes to automate the design of UAV swarming behaviours by defining a multi-objective optimisation problem, so called Coverage of a Connected-UAV Swarm (CCUS), and designing a Q-Learning based Hyper-Heuristic (QLHH) for generating distributed CCUS heuristics. Experimental results demonstrate the capacity of QLHH to generate efficient heuristics for any instance from a given class. [less ▲]

Detailed reference viewed: 126 (36 UL)
Full Text
Peer Reviewed
See detailLocal Community Detection Algorithm with Self-defining Source Nodes
Esmaeilzadeh Dilmaghani, Saharnaz UL; Brust, Matthias R. UL; Danoy, Grégoire UL et al

in Complex Networks & Their Applications IX (2020, September 01)

Surprising insights in community structures of complex networks have raised tremendous interest in developing various kinds of community detection algorithms. Considering the growing size of existing ... [more ▼]

Surprising insights in community structures of complex networks have raised tremendous interest in developing various kinds of community detection algorithms. Considering the growing size of existing networks, local community detection methods have gained attention in contrast to global methods that impose a top-down view of global network information. Current local community detection algorithms are mainly aimed to discover local communities around a given node. Besides, their performance is influenced by the quality of the source node. In this paper, we propose a community detection algorithm that outputs all the communities of a network benefiting from a set of local principles and a self-defining source node selection. Each node in our algorithm progressively adjusts its community label based on an even more restrictive level of locality, considering its neighbours local information solely. Our algorithm offers a computational complexity of linear order with respect to the network size. Experiments on both artificial and real networks show that our algorithm gains moreover networks with weak community structures compared to networks with strong community structures. Additionally, we provide experiments to demonstrate the ability of the self-defining source node of our algorithm by implementing various source node selection methods from the literature. [less ▲]

Detailed reference viewed: 109 (23 UL)
Full Text
Peer Reviewed
See detailProceedings of the 6th Global Conference on Artificial Intelligence (GCAI 2020)
Danoy, Grégoire UL; Pang, Jun UL; Sutcliffe

in 6th Global Conference on Artificial Intelligence (2020, May)

Detailed reference viewed: 161 (24 UL)
Full Text
Peer Reviewed
See detailPrivacy and Security of Big Data in AI Systems:A Research and Standards Perspective
Esmaeilzadeh Dilmaghani, Saharnaz UL; Brust, Matthias R. UL; Danoy, Grégoire UL et al

in 2019 IEEE International Conference on Big Data (Big Data), 9-12 December 2019 (2020, February 24)

Detailed reference viewed: 387 (33 UL)
Full Text
Peer Reviewed
See detailBayesian optimisation to select Rössler system parameters used in Chaotic Ant Colony Optimisation for Coverage
Rosalie, Martin; Kieffer, Emmanuel UL; Brust, Matthias R. UL et al

in Journal of Computational Science (2020), 41

Detailed reference viewed: 156 (34 UL)