English
Related papers

Related papers: Directional approach to gradual cover: the continu…

200 papers

We consider the problem of constructing distribution-free prediction sets with finite-sample conditional guarantees. Prior work has shown that it is impossible to provide exact conditional coverage universally in finite samples. Thus, most…

Methodology · Statistics 2024-09-18 Isaac Gibbs , John J. Cherian , Emmanuel J. Candès

On construction sites, progress must be monitored continuously to ensure that the current state corresponds to the planned state in order to increase efficiency, safety and detect construction defects at an early stage. Autonomous mobile…

Robotics · Computer Science 2023-02-03 Katrin Becker , Martin Oehler , Oskar von Stryk

To ensure reliable object detection in autonomous systems, the detector must be able to adapt to changes in appearance caused by environmental factors such as time of day, weather, and seasons. Continually adapting the detector to…

Computer Vision and Pattern Recognition · Computer Science 2023-11-22 Anh-Dzung Doan , Bach Long Nguyen , Surabhi Gupta , Ian Reid , Markus Wagner , Tat-Jun Chin

In this paper we propose a periodic solution to the problem of persistently covering a finite set of interest points with a group of autonomous mobile agents. These agents visit periodically the points and spend some time carrying out the…

Robotics · Computer Science 2024-01-25 José Manuel Palacios-Gasós , Eduardo Montijano , Carlos Sagüés , Sergio Llorente

The interest in 3D dynamical tracking is growing in fields such as robotics, biology and fluid dynamics. Recently, a major source of progress in 3D tracking has been the study of collective behaviour in biological systems, where the…

Computer Vision and Pattern Recognition · Computer Science 2015-11-05 Andrea Cavagna , Chiara Creato , Lorenzo Del Castello , Stefania Melillo , Leonardo Parisi , Massimiliano Viale

Autonomous Valet Parking (AVP) requires planning under partial observability, where parking spot availability evolves as dynamic agents enter and exit spots. Existing approaches either rely only on instantaneous spot availability or make…

For uncertainty propagation of highly complex and/or nonlinear problems, one must resort to sample-based non-intrusive approaches [1]. In such cases, minimizing the number of function evaluations required to evaluate the response surface is…

Numerical Analysis · Mathematics 2017-12-04 Anindya Bhaduri , Lori Graham-Brady

The state of polarization and the carrier phase drift dynamically during transmission in a random fashion in coherent optical fiber communications. The typical digital signal processing solution to mitigate these impairments consists of two…

Information Theory · Computer Science 2024-01-25 Cristian B. Czegledi , Erik Agrell , Magnus Karlsson , Pontus Johannisson

In traditional facility location problems, a set of points is provided, and the objective is to determine the best location for a new facility based on criteria such as minimizing cost, time, and distances between clients and facilities.…

Optimization and Control · Mathematics 2025-03-11 Nazanin Tour-Savadkoohi , Jafar Fathali

An optimization method is proposed in this paper for novel deployment of given number of directional landmarks (location and pose) within a given region in the 3-D task space. This new deployment technique is built on the geometric models…

Computer Vision and Pattern Recognition · Computer Science 2022-03-29 Zike Lei , Xi Chen , Ying Tan , Xiang Chen , Li Chai

This paper introduces a new step to the Direct Search Method (DSM) to strengthen its convergence analysis. By design, this so-called covering step may ensure that for all refined points of the sequence of incumbent solutions generated by…

Optimization and Control · Mathematics 2024-11-15 Charles Audet , Pierre-Yves Bouchet. Loïc Bourdin

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required.

Distributed, Parallel, and Cluster Computing · Computer Science 2009-05-02 Valentin Polishchuk , Jukka Suomela

Sequential monitoring of images has broad applications across various domains, including climate science, ecosystem monitoring, medical diagnostics, and so forth. In many such applications, images acquired over time exhibit gradual changes,…

Applications · Statistics 2025-06-18 Subhasish Basak , Anik Roy , Partha Sarathi Mukherjee

This paper introduces a very general discrete covering location model that accounts for uncertainty and time-dependent aspects. A MILP formulation is proposed for the problem. Afterwards, it is observed that most of the models existing in…

Optimization and Control · Mathematics 2024-03-28 Alfredo Marín , Luisa I. Martínez-Merino , Antonio M. Rodríguez-Chía , Francisco Saldanha-da-Gama

Coverage motion planning is essential to a wide range of robotic tasks. Unlike conventional motion planning problems, which reason over temporal sequences of states, coverage motion planning requires reasoning over the spatial distribution…

Robotics · Computer Science 2025-11-17 Max M. Sun , Jueun Kwon , Todd Murphey

Object detection is a basic computer vision task to loccalize and categorize objects in a given image. Most state-of-the-art detection methods utilize a fixed number of proposals as an intermediate representation of object candidates, which…

Computer Vision and Pattern Recognition · Computer Science 2022-07-13 Yiming Cui , Linjie Yang , Ding Liu

Accurate demand forecasting is vital for ensuring reliable access to contraceptive products, supporting key processes like procurement, inventory, and distribution. However, forecasting contraceptive demand in developing countries presents…

Machine Learning · Computer Science 2025-03-10 Harsha Chamara Hewage , Bahman Rostami-Tabar , Aris Syntetos , Federico Liberatore , Glenn Milano

Complex systems in science and engineering sometimes exhibit behavior that changes across different regimes. Traditional global models struggle to capture the full range of this complex behavior, limiting their ability to accurately…

Machine Learning · Computer Science 2023-07-24 Okezzi F. Ukorigho , Opeoluwa Owoyele

Direct collocation methods are powerful tools to solve trajectory optimization problems in robotics. While their resulting trajectories tend to be dynamically accurate, they may also present large kinematic errors in the case of constrained…

Robotics · Computer Science 2023-04-26 Ricard Bordalba , Tobias Schoels , Lluís Ros , Josep M. Porta , Moritz Diehl

We consider a generalization of the classical planar maximum coverage location problem (PMCLP) in which partial coverage is allowed, facilities have adjustable quality of service (QoS) or service range, and demand zones and service zone of…

Optimization and Control · Mathematics 2020-12-17 Manish Bansal , Parshin Shojaee