![]() Fiscarelli, Antonio Maria ![]() ![]() in Scientific Reports (2021) Detailed reference viewed: 23 (3 UL)![]() Samir Labib, Nader ![]() ![]() ![]() 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: 36 (1 UL)![]() Esmaeilzadeh Dilmaghani, Saharnaz ![]() ![]() ![]() 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: 58 (2 UL)![]() Esmaeilzadeh Dilmaghani, Saharnaz ![]() ![]() ![]() 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: 41 (8 UL)![]() Duflo, Gabriel ![]() ![]() ![]() 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: 10 (1 UL)![]() Esmaeilzadeh Dilmaghani, Saharnaz ![]() ![]() ![]() 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: 26 (6 UL)![]() Danoy, Grégoire ![]() ![]() in 6th Global Conference on Artificial Intelligence (2020, May) Detailed reference viewed: 98 (9 UL)![]() Esmaeilzadeh Dilmaghani, Saharnaz ![]() ![]() ![]() in 2019 IEEE International Conference on Big Data (Big Data), 9-12 December 2019 (2020, February 24) Detailed reference viewed: 157 (22 UL)![]() Kieffer, Emmanuel ![]() ![]() ![]() in IEEE Transactions on Evolutionary Computation (2020), 24(1), 44--56 Detailed reference viewed: 42 (7 UL)![]() Danoy, Grégoire ![]() in 2020 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2020, New Orleans, LA, USA, May 18-22, 2020 (2020) Detailed reference viewed: 60 (1 UL)![]() Duflo, Gabriel ![]() ![]() ![]() Scientific Conference (2020) Detailed reference viewed: 10 (0 UL)![]() Duflo, Gabriel ![]() ![]() ![]() in GECCO '20: Genetic and Evolutionary Computation Conference, Companion Volume, Cancún, Mexico, July 8-12, 2020 (2020) Detailed reference viewed: 45 (7 UL)![]() Changaival, Boonyarit ![]() ![]() in GECCO '20: Genetic and Evolutionary Computation Conference, Companion Volume, Cancún, Mexico, July 8-12, 2020 (2020) Detailed reference viewed: 34 (4 UL)![]() Stolfi Rosso, Daniel ![]() ![]() ![]() in IEEE 17th Annual Consumer Communications & Networking Conference CCNC 2020, Las Vegas, NV, USA, January 10-13, 2020 (2020) Detailed reference viewed: 32 (4 UL)![]() Stolfi Rosso, Daniel ![]() ![]() ![]() in 2020 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2020, New Orleans, LA, USA, May 18-22, 2020 (2020) Detailed reference viewed: 98 (4 UL)![]() Stolfi Rosso, Daniel ![]() ![]() ![]() in Optimization and Learning - Third International Conference, OLA 2020, Cádiz, Spain, February 17-19, 2020, Proceedings (2020) Detailed reference viewed: 68 (6 UL)![]() ; ; et al in High Performance Computing (2020) This article explores the application of evolutionary algorithms and agent-oriented programming to solve the problem of searching and monitoring objectives through a fleet of unmanned aerial vehicles. The ... [more ▼] This article explores the application of evolutionary algorithms and agent-oriented programming to solve the problem of searching and monitoring objectives through a fleet of unmanned aerial vehicles. The subproblem of static off-line planning is studied to find initial flight plans for each vehicle in the fleet, using evolutionary algorithms to achieve compromise values between the size of the explored area, the proximity of the vehicles, and the monitoring of points of interest defined in the area. The results obtained in the experimental analysis on representative instances of the surveillance problem indicate that the proposed techniques are capable of computing effective flight plans. [less ▲] Detailed reference viewed: 103 (15 UL)![]() Stolfi Rosso, Daniel ![]() ![]() ![]() in Sensors (2020), 20(9), 2566 Detailed reference viewed: 63 (7 UL)![]() Brust, Matthias R. ![]() ![]() ![]() in Intelligent Information and Database Systems - 12th Asian Conference ACIIDS 2020, Phuket, Thailand, March 23-26, 2020, Companion Proceedings (2020) Detailed reference viewed: 46 (7 UL)![]() ; Kieffer, Emmanuel ![]() ![]() in Journal of Computational Science (2020), 41 Detailed reference viewed: 74 (14 UL) |
||