arXiv subjects

Panayiotis Kolios

Publications and source records attributed to Panayiotis Kolios.

53 records · Page 3Linked to original sources

arXiv2023

Distributed Search Planning in 3-D Environments With a Dynamically Varying Number of Agents

In this work, a novel distributed search-planning framework is proposed, where a dynamically varying team of autonomous agents cooperate in order to search multiple objects of interest in three-dimension (3-D). It is assumed that the agents can enter and exit the mission space at any point in time, and as a result the number of agents that actively participate in the mission varies over time. The proposed distributed search-planning framework takes into account the agent dynamical and sensing model, and the dynamically varying number of agents, and utilizes model predictive control (MPC) to generate cooperative search trajectories over a finite rolling planning horizon. This enables the agents to adapt their decisions on-line while considering the plans of their peers, maximizing their search planning performance, and reducing the duplication of work.

eess.SY↗

arXiv2023

Towards Automated 3D Search Planning for Emergency Response Missions

The ability to efficiently plan and execute automated and precise search missions using unmanned aerial vehicles (UAVs) during emergency response situations is imperative. Precise navigation between obstacles and time-efficient searching of 3D structures and buildings are essential for locating survivors and people in need in emergency response missions. In this work we address this challenging problem by proposing a unified search planning framework that automates the process of UAV-based search planning in 3D environments. Specifically, we propose a novel search planning framework which enables automated planning and execution of collision-free search trajectories in 3D by taking into account low-level mission constrains (e.g., the UAV dynamical and sensing model), mission objectives (e.g., the mission execution time and the UAV energy efficiency) and user-defined mission specifications (e.g., the 3D structures to be searched and minimum detection probability constraints). The capabilities and performance of the proposed approach are demonstrated through extensive simulated 3D search scenarios.

cs.RO↗

arXiv2023

Downing a Rogue Drone with a Team of Aerial Radio Signal Jammers

This work proposes a novel distributed control framework in which a team of pursuer agents equipped with a radio jamming device cooperate in order to track and radio-jam a rogue target in 3D space, with the ultimate purpose of disrupting its communication and navigation circuitry. The target evolves in 3D space according to a stochastic dynamical model and it can appear and disappear from the surveillance area at random times. The pursuer agents cooperate in order to estimate the probability of target existence and its spatial density from a set of noisy measurements in the presence of clutter. Additionally, the proposed control framework allows a team of pursuer agents to optimally choose their radio transmission levels and their mobility control actions in order to ensure uninterrupted radio jamming to the target, as well as to avoid the jamming interference among the team of pursuer agents. Extensive simulation analysis of the system's performance validates the applicability of the proposed approach.

eess.SY↗

arXiv2023

3D Trajectory Planning for UAV-based Search Missions: An Integrated Assessment and Search Planning Approach

The ability to efficiently plan and execute search missions in challenging and complex environments during natural and man-made disasters is imperative. In many emergency situations, precise navigation between obstacles and time-efficient searching around 3D structures is essential for finding survivors. In this work we propose an integrated assessment and search planning approach which allows an autonomous UAV (unmanned aerial vehicle) agent to plan and execute collision-free search trajectories in 3D environments. More specifically, the proposed search-planning framework aims to integrate and automate the first two phases (i.e., the assessment phase and the search phase) of a traditional search-and-rescue (SAR) mission. In the first stage, termed assessment-planning we aim to find a high-level assessment plan which the UAV agent can execute in order to visit a set of points of interest. The generated plan of this stage guides the UAV to fly over the objects of interest thus providing a first assessment of the situation at hand. In the second stage, termed search-planning, the UAV trajectory is further fine-tuned to allow the UAV to search in 3D (i.e., across all faces) the objects of interest for survivors. The performance of the proposed approach is demonstrated through extensive simulation analysis.

cs.RO↗

arXiv2023

Cooperative Simultaneous Tracking and Jamming for Disabling a Rogue Drone

This work investigates the problem of simultaneous tracking and jamming of a rogue drone in 3D space with a team of cooperative unmanned aerial vehicles (UAVs). We propose a decentralized estimation, decision and control framework in which a team of UAVs cooperate in order to a) optimally choose their mobility control actions that result in accurate target tracking and b) select the desired transmit power levels which cause uninterrupted radio jamming and thus ultimately disrupt the operation of the rogue drone. The proposed decision and control framework allows the UAVs to reconfigure themselves in 3D space such that the cooperative simultaneous tracking and jamming (CSTJ) objective is achieved; while at the same time ensures that the unwanted inter-UAV jamming interference caused during CSTJ is kept below a specified critical threshold. Finally, we formulate this problem under challenging conditions i.e., uncertain dynamics, noisy measurements and false alarms. Extensive simulation experiments illustrate the performance of the proposed approach.

cs.RO↗

arXiv2023

Decentralized Search and Track with Multiple Autonomous Agents

In this paper we study the problem of cooperative searching and tracking (SAT) of multiple moving targets with a group of autonomous mobile agents that exhibit limited sensing capabilities. We assume that the actual number of targets is not known a priori and that target births/deaths can occur anywhere inside the surveillance region. For this reason efficient search strategies are required to detect and track as many targets as possible. To address the aforementioned challenges we augment the classical Probability Hypothesis Density (PHD) filter with the ability to propagate in time the search density in addition to the target density. Based on this, we develop decentralized cooperative look-ahead strategies for efficient searching and tracking of an unknown number of targets inside a bounded surveillance area. The performance of the proposed approach is demonstrated through simulation experiments.

eess.SY↗

arXiv2023

Probabilistic Search and Track with Multiple Mobile Agents

In this paper we are interested in the task of searching and tracking multiple moving targets in a bounded surveillance area with a group of autonomous mobile agents. More specifically, we assume that targets can appear and disappear at random times inside the surveillance region and their positions are random and unknown. The agents have a limited sensing range, and due to sensor imperfections they receive noisy measurements from the targets. In this work we utilize the theory of random finite sets (RFS) to capture the uncertainty in the time-varying number of targets and their states and we propose a decision and control framework, in which the mode of operation (i.e. search or track) as well as the mobility control action for each agent, at each time instance, are determined so that the collective goal of searching and tracking is achieved. Extensive simulation results demonstrate the effectiveness and performance of the proposed solution.

eess.SY↗

arXiv2023

Jointly-Optimized Searching and Tracking with Random Finite Sets

In this paper, we investigate the problem of joint searching and tracking of multiple mobile targets by a group of mobile agents. The targets appear and disappear at random times inside a surveillance region and their positions are random and unknown. The agents have limited sensing range and receive noisy measurements from the targets. A decision and control problem arises, where the mode of operation (i.e., search or track) as well as the mobility control action for each agent, at each time instance, must be determined so that the collective goal of searching and tracking is achieved. We build our approach upon the theory of random finite sets (RFS) and we use Bayesian multi-object stochastic filtering to simultaneously estimate the time-varying number of targets and their states from a sequence of noisy measurements. We formulate the above problem as a non-linear binary program (NLBP) and show that it can be approximated by a genetic algorithm. Finally, to study the effectiveness and performance of the proposed approach we have conducted extensive simulation experiments.

eess.SY↗

arXiv2022

SafeDrones: Real-Time Reliability Evaluation of UAVs using Executable Digital Dependable Identities

The use of Unmanned Arial Vehicles (UAVs) offers many advantages across a variety of applications. However, safety assurance is a key barrier to widespread usage, especially given the unpredictable operational and environmental factors experienced by UAVs, which are hard to capture solely at design-time. This paper proposes a new reliability modeling approach called SafeDrones to help address this issue by enabling runtime reliability and risk assessment of UAVs. It is a prototype instantiation of the Executable Digital Dependable Identity (EDDI) concept, which aims to create a model-based solution for real-time, data-driven dependability assurance for multi-robot systems. By providing real-time reliability estimates, SafeDrones allows UAVs to update their missions accordingly in an adaptive manner.

cs.RO↗

arXiv2022

Periodic and Event-Triggering for Joint Capacity Maximization and Safe Intersection Crossing

Intersection crossing represents a bottleneck for transportation systems and Connected Autonomous Vehicles (CAVs) may be the groundbreaking solution to the problem. This work proposes a novel framework, i.e, AVOID-PERIOD, where an Intersection Manager (IM) controls CAVs approaching an intersection in order to maximize intersection capacity while minimizing the CAVs' gas consumption. Contrary to most of the works in the literature, the CAVs' location uncertainty is accounted for and periodic communication and re-optimization allows for the creation of safe trajectories for the CAVs. To improve scalability for high-traffic intersections, an event-triggering approach is also developed (AVOID-EVENT) that minimizes computational and communication complexity. AVOID-EVENT reduces the number of re-optimizations required by 92.2%, while retaining most of the benefits introduced by AVOID-PERIOD.

cs.RO↗

arXiv2022

An Autonomous Drone System with Jamming and Relative Positioning Capabilities

As the number of unauthorized operations of Unmanned Aerial Vehicles (UAVs) is rising, the implementation of a versatile counter-drone system is becoming a necessity. In this work, we develop a drone-based counter-drone system, that employs algorithms for detecting and tracking a rogue drone, in conjunction with wireless interception capabilities to jointly jam the rogue drone while achieving self positioning for the pursuer drone. In the proposed system a software-defined-radio (SDR) is used for switching between jamming transmissions and spectrum sweeping functionalities to achieve the desired GPS disruption and self-localization, respectively. Extensive field experiments demonstrate the effectiveness of the proposed solution in a realworld environment under various parameter settings.

eess.SP↗

arXiv2022

Adaptive Frequency Band Selection for Accurate and Fast Positioning utilizing SOPs

Signals of opportunity (SOPs) are a promising technique that can be used for relative positioning in areas where global navigation satellite system (GNSS) information is unreliable or unavailable. This technique processes features of the various signals transmitted over a broad wireless spectrum to enable a receiver to position itself in space. This work examines the frequency selection problem in order to achieve fast and accurate positioning using only the received signal strength (RSS) of the surrounding signals. Starting with a prior belief, the problem of searching for a frequency band that best matches a predicted location trajectory is investigated. To maximize the accuracy of the position estimate, a ranking-and-selection problem is mathematically formulated. A knowledge-gradient (KG) algorithm from optimal learning theory is proposed that uses correlations in the Bayesian prior beliefs of the frequency band values to dramatically reduce the algorithm's processing time. The technique is experimentally tested for a practical scenario of an unmanned aerial vehicle (UAV) moving around a GPS-denied environment, with obtained results demonstrating its validity and practical applicability.

eess.SP↗

arXiv2021

Scheduling Aerial Vehicles in an Urban Air Mobility Scheme

Highly populated cities face several challenges, one of them being the intense traffic congestion. In recent years, the concept of Urban Air Mobility has been put forward by large companies and organizations as a way to address this problem, and this approach has been rapidly gaining ground. This disruptive technology involves aerial vehicles (AVs) for hire than can be utilized by customers to travel between locations within large cities. This concept has the potential to drastically decrease traffic congestion and reduce air pollution, since these vehicles typically use electric motors powered by batteries. This work studies the problem of scheduling the assignment of AVs to customers, having as a goal to maximize the serviced customers and minimize the energy consumption of the AVs by forcing them to fly at the lowest possible altitude. Initially, an Integer Linear Program (ILP) formulation is presented, that is solved offline and optimally, followed by a near-optimal algorithm, that solves the problem incrementally, one AV at a time, to address scalability issues, allowing scheduling in problems involving large numbers of locations, AVs, and customer requests.

cs.AI↗

arXiv2020

Relative Positioning of Autonomous Systems using Signals of Opportunity

For reliable operation, next generation autonomous agents will need enhanced situational perception as well as precise navigation capabilities. The global navigation satellite system (GNSS) signals that are utilized by practically all modern positioning systems cannot satisfy this requirement for heighten autonomy levels and positioning is becoming a decisive factor for their proliferation. This work investigates how relative positioning can be achieved using signals that are already accessible in the environment, and derives an online procedure for the exploitation of these signals for localization in GNSS-challenged areas. The proposed relative positioning system (RPS) explores the signal properties over a large spectrum of frequency bands, and derives a vehicle tracking algorithm to accurately estimate the vehicle's trajectory in space and time using an arbitrary set of unknown reference positions. Experimental results demonstrate the applicability of RPS and investigate its performance over the different parameter values.

eess.SP↗

arXiv2020

Optimized tour planning for drone-based urban traffic monitoring

Drones or Unmanned Aerial Vehicles (UAVs) have become a reliable and efficient tool for road traffic monitoring. Compared to loop detectors and bluetooth receivers (with high capital and operational expenditure), drones are a low-cost alternative that offers great flexibility and high quality data. In this work, we derive optimized tour plans that a fleet of drones can follow for rapid traffic monitoring across particular regions of transportation network. To derive these tours, we first identify monitoring locations over which drones should fly through and then compute minimum travel-time tours based on realistic resource constraints. Evaluation results are presented over a real road network topology to demonstrate the applicability of the proposed approach.

math.OC↗

arXiv2020

Extracting the fundamental diagram from aerial footage

Efficient traffic monitoring is playing a fundamental role in successfully tackling congestion in transportation networks. Congestion is strongly correlated with two measurable characteristics, the demand and the network density that impact the overall system behavior. At large, this system behavior is characterized through the fundamental diagram of a road segment, a region or the network. In this paper we devise an innovative way to obtain the fundamental diagram through aerial footage obtained from drone platforms. The derived methodology consists of 3 phases: vehicle detection, vehicle tracking and traffic state estimation. We elaborate on the algorithms developed for each of the 3 phases and demonstrate the applicability of the results in a real-world setting.

cs.CV↗

arXiv2020

Extending the Multiple Traveling Salesman Problem for Scheduling a Fleet of Drones Performing Monitoring Missions

In this paper we schedule the travel path of a set of drones across a graph where the nodes need to be visited multiple times at pre-defined points in time. This is an extension of the well-known multiple traveling salesman problem. The proposed formulation can be applied in several domains such as the monitoring of traffic flows in a transportation network, or the monitoring of remote locations to assist search and rescue missions. Aiming to find the optimal schedule, the problem is formulated as an Integer Linear Program (ILP). Given that the problem is highly combinatorial, the optimal solution scales only for small sized problems. Thus, a greedy algorithm is also proposed that uses a one-step look ahead heuristic search mechanism. In a detailed evaluation, it is observed that the greedy algorithm has near-optimal performance as it is on average at 92.06% of the optimal, while it can potentially scale up to settings with hundreds of drones and locations.

cs.AI↗