English
Related papers

Related papers: Changeable Sweep Coverage Problem

200 papers

Coverage problems are central in optimization and have a wide range of applications in data mining and machine learning. While several distributed algorithms have been developed for coverage problems, the existing methods suffer from…

Data Structures and Algorithms · Computer Science 2017-03-13 MohammadHossein Bateni , Hossein Esfandiari , Vahab Mirrokni

A major barrier to wide adoption of Electric Vehicles (EVs) is the absence of reliable and equitable charging infrastructure. Poorly located charging stations create coverage gaps and slow down EV adoption, especially in underserved…

Optimization and Control · Mathematics 2026-02-03 Hamid Najafzad , Moddassir Khan Nayeem , Fuhad Ahmed Opu , Omar Abbaas , Gabriel Nicolosi

Sensor placement optimization methods have been studied extensively. They can be applied to a wide range of applications, including surveillance of known environments, optimal locations for 5G towers, and placement of missile defense…

Machine Learning · Computer Science 2024-05-22 Lukas Taus , Yen-Hsi Richard Tsai

Driven by the Internet of Things vision, recent years have seen the rise of new horizons for the wireless ecosystem in which a very large number of mobile low power devices interact to run sophisticated applications. The main hindrance to…

Information Theory · Computer Science 2018-07-10 Ayse Ipek Akin , Nafiseh Janatian , Ivan Stupia , Luc Vandendorpe

The concept of sensor networks (WSNs) has become an important component of the recently proposed cyber-physical systems (CPSs) and Internet of Things which can connect the physical world with embedded software systems. Energy- harvesting…

Signal Processing · Electrical Eng. & Systems 2018-06-22 Peng Hu

We consider the problem of covering multiple submodular constraints. Given a finite ground set $N$, a cost function $c: N \rightarrow \mathbb{R}_+$, $r$ monotone submodular functions $f_1,f_2,\ldots,f_r$ over $N$ and requirements…

Data Structures and Algorithms · Computer Science 2025-09-04 Tanvi Bajpai , Chandra Chekuri , Pooja Kulkarni

Constraint satisfaction problems (CSPs) are about finding values of variables that satisfy the given constraints. We show that Transformer extended with recurrence is a viable approach to learning to solve CSPs in an end-to-end manner,…

Artificial Intelligence · Computer Science 2023-07-12 Zhun Yang , Adam Ishay , Joohyung Lee

We study the maximum constraint satisfaction problem, Max-CSP, in the streaming setting. Given $n$ variables, the constraints arrive sequentially in an arbitrary order, with each constraint involving only a small subset of the variables.…

Data Structures and Algorithms · Computer Science 2026-04-03 Amir Azarmehr , Soheil Behnezhad , Shane Ferrante

In this work we propose a coverage planning control approach which allows a mobile agent, equipped with a controllable sensor (i.e., a camera) with limited sensing domain (i.e., finite sensing range and angle of view), to cover the surface…

We present controllers that enable mobile robots to persistently monitor or sweep a changing environment. The changing environment is modeled as a field which grows in locations that are not within range of a robot, and decreases in…

Robotics · Computer Science 2016-11-18 Stephen L. Smith , Mac Schwager , Daniela Rus

We study the problem of wireless sensor network design by deploying a minimum number of additional relay nodes (to minimize network cost) at a subset of given potential relay locations, in order to convey the data from already existing…

Networking and Internet Architecture · Computer Science 2014-04-23 Abhijit Bhattacharya , Anurag Kumar

We introduce a new bounding approach called Continuity* C*, which provides optimality guarantees for the Moving-Target Traveling Salesman Problem (MT-TSP). Our approach relaxes the continuity constraints on the agent's tour by partitioning…

Robotics · Computer Science 2024-12-04 Allen George Philip , Zhongqiang Ren , Sivakumar Rathinam , Howie Choset

The multi-agent spatial coverage control problem encompasses a broad research domain, dealing with both dynamic and static deployment strategies, discrete-task assignments, and spatial distribution-matching deployment. Coverage control may…

Robotics · Computer Science 2024-07-22 Solmaz Kia , Sonia Martinez

Wireless powered communication networks are becoming an effective solution for improving self sustainability of mobile devices. In this context, a hybrid access point transfers energy to a group of nodes, which use the harvested energy to…

Information Theory · Computer Science 2016-01-29 Alessandro Biason , Michele Zorzi

Wireless energy transfer, namely RF-based energy harvesting, is a potential way to prolong the lifetime of energy-constrained devices, especially in wireless sensor networks. However, due to huge propagation attenuation, its energy…

Information Theory · Computer Science 2016-11-17 Tao Li , Pingyi Fan , Zhengchuan Chen , Khaled Ben Letaief

We introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Nodes with capacity for storing a certain commodity…

Data Structures and Algorithms · Computer Science 2017-12-15 Thomas Bosman , Martijn van Ee , Yang Jiao , Alberto Marchetti-Spaccamela , R. Ravi , Leen Stougie

We study the so-called dynamic coverage problem by agents located in some topological graph. The agents must visit all regions of interest but they also should stay connected to the base via multi-hop. We prove that the algorithmic…

Multiagent Systems · Computer Science 2018-10-16 Tristan Charrier , François Schwarzentruber , Eva Soulier

Electric vehicles (EVs) have enjoyed increasing adoption because of the global concerns about the petroleum dependence and greenhouse gas emissions. However, their limited driving range fosters the occurrence of charging requests deriving…

Systems and Control · Electrical Eng. & Systems 2019-08-13 Yongxing Wang , Jun Bi

This paper is concerned by the problem of selecting an optimal sampling set of sensors over a network of time series for the purpose of signal recovery at non-observed sensors with a minimal reconstruction error. The problem is motivated by…

Machine Learning · Statistics 2020-04-27 Yiye Jiang , Jérémie Bigot , Sofian Maabout

Source-channel coding for an energy limited wireless sensor node is investigated. The sensor node observes independent Gaussian source samples with variances changing over time slots and transmits to a destination over a flat fading…

Information Theory · Computer Science 2016-11-17 Oner Orhan , Deniz Gunduz , Elza Erkip
‹ Prev 1 8 9 10 Next ›