English
Related papers

Related papers: Navigating through the O(N) archipelago

200 papers

Inspired by the classical fractional cascading technique, we introduce new techniques to speed up the following type of iterated search in 3D: The input is a graph $\mathbf{G}$ with bounded degree together with a set $H_v$ of 3D hyperplanes…

Computational Geometry · Computer Science 2025-04-11 Peyman Afshani , Yakov Nekrich , Frank Staals

We propose a new class of method for solving nonlinear systems of equations, which, among other things,has four nice features: (i) it is inspired by the mathematical property of damped oscillators, (ii) it can be regarded as a simple…

Numerical Analysis · Computer Science 2018-09-13 Hirotada Okawa , Kotaro Fujisawa , Yu Yamamoto , Ryosuke Hirai , Nobutoshi Yasutake , Hiroki Nagakura , Shoichi Yamada

Acquiring plausible pathways on high-dimensional structural distributions is beneficial in several domains. For example, in the drug discovery field, a protein conformational pathway, i.e. a highly probable sequence of protein structural…

Quantitative Methods · Quantitative Biology 2025-06-04 Ziyad Oulhaj , Yoshiyuki Ishii , Kento Ohga , Kimihiro Yamazaki , Mutsuyo Wada , Yuhei Umeda , Takashi Kato , Yuichiro Wada , Hiroaki Kurihara

Ground robot navigation in complex 3D environments is often hindered by geometric ambiguity, where non-traversable structures such as furniture share local geometric properties with navigable ground. Furthermore, the computational cost of…

Robotics · Computer Science 2026-05-19 Yifan Du , Chengwei Zhang , Siyu Liao , Zhongfeng Wang

Let $\mathscr O$ be a set of $n$ disjoint obstacles in $\mathbb{R}^2$, $\mathscr M$ be a moving object. Let $s$ and $l$ denote the starting point and maximum path length of the moving object $\mathscr M$, respectively. Given a point $p$ in…

Data Structures and Algorithms · Computer Science 2018-07-04 Jack Wang

This paper addresses the problem of multi-robot navigation where robots maneuver on a desired \(m\)-dimensional (i.e., \(m\)-D) manifold in the $n$-dimensional Euclidean space, and maintain a {\it flexible spatial ordering}. We consider $…

Robotics · Computer Science 2025-10-22 Bin-Bin Hu , Weijia Yao , Ming Cao

Federated learning (FL) is a promising learning paradigm that can tackle the increasingly prominent isolated data islands problem while keeping users' data locally with privacy and security guarantees. However, FL could result in…

Information Theory · Computer Science 2022-03-30 Peng Yang , Yuning Jiang , Ting Wang , Yong Zhou , Yuanming Shi , Colin N. Jones

This paper proposes a novel method of coverage path planning for the purpose of scanning an unstructured environment autonomously. The method uses the morphological skeleton of the prior 2D navigation map via SLAM to generate a sequence of…

Robotics · Computer Science 2026-02-17 Alexander James Becoy , Kseniia Khomenko , Luka Peternel , Raj Thilak Rajan

While classical data analysis has addressed observations that are real numbers or elements of a real vector space, at present many statistical problems of high interest in the sciences address the analysis of data that consist of more…

Statistics Theory · Mathematics 2023-08-15 Zhigang Yao , Jiaji Su , Bingjie Li , Shing-Tung Yau

In this paper we propose an improvement for flowpipe-construction-based reachability analysis techniques for hybrid systems. Such methods apply iterative successor computations to pave the reachable region of the state space by state sets…

Systems and Control · Computer Science 2017-07-18 Stefan Schupp , Johanna Nellen , Erika Ábrahám

This survey provides an examination of the use of Deep Neural Networks (DNN) in Collaborative Filtering (CF) recommendation systems. As the digital world increasingly relies on data-driven approaches, traditional CF techniques face…

Artificial Intelligence · Computer Science 2024-12-03 Pang Li , Shahrul Azman Mohd Noah , Hafiz Mohd Sarim

Safe navigation in cluttered environments is an important challenge for autonomous systems. Robots navigating through obstacle ridden scenarios need to be able to navigate safely in the presence of obstacles, goals, and ego objects of…

Systems and Control · Electrical Eng. & Systems 2026-05-05 Omanshu Thapliyal , Malarvizhi Sankaranarayanasamy , Ravigopal Vennelakanti

Sampling from combinatorial families can be difficult. However, complicated families can often be embedded within larger, simpler ones, for which easy sampling algorithms are known. We take advantage of such a relationship to describe a…

Data Structures and Algorithms · Computer Science 2013-09-02 James Y. Zhao

The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…

Computational Geometry · Computer Science 2023-02-21 Sujoy Bhore , Robert Ganian , Liana Khazaliya , Fabrizio Montecchiani , Martin Nöllenburg

We give an iterative algorithm for finding the maximum flow between a set of sources and sinks that lie on the boundary of a planar graph. Our algorithm uses only O(n) queries to simple data structures, achieving an O(n log n) running time…

Data Structures and Algorithms · Computer Science 2013-06-25 Glencora Borradaile , Anna Harutyunyan

We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph. We compare runtimes in computing OT distances on data…

Data Structures and Algorithms · Computer Science 2020-07-07 Yihe Dong , Yu Gao , Richard Peng , Ilya Razenshteyn , Saurabh Sawlani

Recently, correlation filters have demonstrated the excellent performance in visual tracking. However, the base training sample region is larger than the object region,including the Interference Region(IR). The IRs in training samples from…

Computer Vision and Pattern Recognition · Computer Science 2018-03-26 Nana Fan , Zhenyu He

With much research has been conducted into trajectory planning for quadrotors, planning with spatial and temporal optimal trajectories in real-time is still challenging. In this paper, we propose a framework for generating large-scale…

Robotics · Computer Science 2020-02-26 Zhepei Wang , Xin Zhou , Chao Xu , Jian Chu , Fei Gao

Obstacle avoidance of quadrotors in dynamic environments is still a very open problem. Current works commonly leverage traditional static maps to represent static obstacles and the detection and tracking of moving objects (DATMO) method to…

Robotics · Computer Science 2022-02-16 Gang Chen , Peng Peng , Peihan Zhang , Wei Dong

Despite the growing impact of Unmanned Aerial Vehicles (UAVs) across various industries, most of current available solutions lack for a robust autonomous navigation system to deal with the appearance of obstacles safely. This work presents…

Robotics · Computer Science 2025-04-23 Jorge Bes , Juan Dendarieta , Luis Riazuelo , Luis Montano