English
Related papers

Related papers: Online Drone Coverage of Targets on a Line

200 papers

We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, the competitive ratio of our algorithm tends to 1, as the…

Computer Science and Game Theory · Computer Science 2009-01-13 Sourav Chakraborty , Nikhil Devanur

Most consumer-level low-cost unmanned aerial vehicles (UAVs) have limited battery power and long charging time. Due to these energy constraints, they cannot accomplish many practical tasks, such as monitoring a sport or political event for…

Robotics · Computer Science 2021-01-27 Jyh-Ming Lien , Sam Rodriguez , Marco Morales

The pandemic by COVID-19 is causing a devastating effect on the health of global population. There are several efforts to prevent the spread of the virus. Among those efforts, cleaning and disinfecting public areas have become important…

Drones equipped with cameras are emerging as a powerful tool for large-scale aerial 3D scanning, but existing automatic flight planners do not exploit all available information about the scene, and can therefore produce inaccurate and…

Computer Vision and Pattern Recognition · Computer Science 2017-08-07 Mike Roberts , Debadeepta Dey , Anh Truong , Sudipta Sinha , Shital Shah , Ashish Kapoor , Pat Hanrahan , Neel Joshi

For two matroids $\mathcal{M}_1$ and $\mathcal{M}_2$ defined on the same ground set $E$, the online matroid intersection problem is to design an algorithm that constructs a large common independent set in an online fashion. The algorithm is…

Data Structures and Algorithms · Computer Science 2018-02-20 Guru Guruganesh , Sahil Singla

In this paper, we consider an online optimization process, where the objective functions are not convex (nor concave) but instead belong to a broad class of continuous submodular functions. We first propose a variant of the Frank-Wolfe…

Machine Learning · Statistics 2018-02-19 Lin Chen , Hamed Hassani , Amin Karbasi

We consider the online stochastic matching problem proposed by Feldman et al. [FMMM09] as a model of display ad allocation. We are given a bipartite graph; one side of the graph corresponds to a fixed set of bins and the other side…

Data Structures and Algorithms · Computer Science 2011-08-03 Vahideh H. Manshadi , Shayan Oveis Gharan , Amin Saberi

The paper presents a strategy for robotic exploration problem using Space-Filling curves (SFC). The strategy plans a path that avoids unknown obstacles while ensuring complete coverage of the free space in region of interest. The region of…

Robotics · Computer Science 2024-03-26 Ashay Wakode , Arpita Sinha

Multi-Robot Coverage problems have been extensively studied in robotics, planning and multi-agent systems. In this work, we consider the coverage problem when there are constraints on the proximity (e.g., maximum distance between the…

Multiagent Systems · Computer Science 2024-12-18 Dolev Mutzari , Yonatan Aumann , Sarit Kraus

Q-learning is widely used to optimize wireless networks with unknown system dynamics. Recent advancements include ensemble multi-environment hybrid Q-learning algorithms, which utilize multiple Q-learning algorithms across structurally…

Signal Processing · Electrical Eng. & Systems 2024-09-02 Talha Bozkus , Urbashi Mitra

The miniaturisation of sensors and processors, the advancements in connected edge intelligence, and the exponential interest in Artificial Intelligence are boosting the affirmation of autonomous nano-size drones in the Internet of Robotic…

Robotics · Computer Science 2025-05-09 Mattia Sartori , Chetna Singhal , Neelabhro Roy , Davide Brunelli , James Gross

We study the discrete bin covering problem where a multiset of items from a fixed set $S \subseteq (0,1]$ must be split into disjoint subsets while maximizing the number of subsets whose contents sum to at least $1$. We study the online…

Data Structures and Algorithms · Computer Science 2024-01-29 Magnus Berg , Shahin Kamali

In this paper, we study the Online Network Formation Problem (ONFP) for a mobile multi-robot system. Consider a group of robots with a bounded communication range operating in a large open area. One of the robots has a piece of information…

Robotics · Computer Science 2019-10-07 Selim Engin , Volkan Isler

Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking,…

Data Structures and Algorithms · Computer Science 2016-02-02 Martin Böhm , Jiří Sgall , Rob van Stee , Pavel Veselý

Imagine an island modeled as a simple polygon $\P$ with $n$ vertices whose coastline we wish to monitor. We consider the problem of building the minimum number of refueling stations along the boundary of $\P$ in such a way that a drone can…

In recent years, there is a noteworthy advancement in autonomous drone racing. However, the primary focus is on attaining execution times, while scant attention is given to the challenges of dynamic environments. The high-speed nature of…

Robotics · Computer Science 2023-06-27 Qianhao Wang , Dong Wang , Chao Xu , Alan Gao , Fei Gao

Drones have a fairly short range due to their limited battery life. We propose an adaptive exploration techniques to extend the range of drones by taking advantage of physical structures such as tall buildings and trees in urban…

Robotics · Computer Science 2020-12-18 Tsz-Chiu Au

Individual agents in natural systems like flocks of birds or schools of fish display a remarkable ability to coordinate and communicate in local groups and execute a variety of tasks efficiently. Emulating such natural systems into drone…

Robotics · Computer Science 2022-05-03 Jagdish Chand Bansal , Nikhil Sethi , Ogbonnaya Anicho , Atulya Nagar

In this study, we develop an innovative data-driven optimization approach to solve the drone delivery service planning problem with online demand. Drone-based logistics are expected to improve operations by enhancing flexibility and…

Optimization and Control · Mathematics 2024-04-04 Aditya Paul , Michael W. Levin , S. Travis Waller , David Rey

We consider the online version of the piercing set problem, where geometric objects arrive one by one, and the online algorithm must maintain a valid piercing set for the already arrived objects by making irrevocable decisions. It is easy…

Computational Geometry · Computer Science 2024-07-04 Minati De , Saksham Jain , Sarat Varma Kallepalli , Satyam Singh