English
Related papers

Related papers: STD-Trees: Spatio-temporal Deformable Trees for Mu…

200 papers

We present an approach that generates kinodynamically feasible paths for robots using Rapidly-exploring Random Tree (RRT). We leverage motion primitives as a way to capture the dynamics of the robot and use these motion primitives to build…

Robotics · Computer Science 2022-10-31 Abhishek Paudel

In this paper, we propose a Bayesian matrix-variate spatiotemporal modeling framework for jointly analyzing multiple response variables observed at spatial locations over time. The approach relaxes the standard assumption of spatial…

Methodology · Statistics 2026-04-23 Rodrigo de Souza Bulhões , Marina Silva Paez , Dani Gamerman

In this paper, we present fixed-parameter tractability algorithms for both the undirected and directed versions of the Spanning Tree Isomorphism Problem, parameterized by the size $k$ of a redundant set. A redundant set is a collection of…

Data Structures and Algorithms · Computer Science 2025-08-08 Fangjian Shen , Yicheng Zheng , Wushao Wen , Hankz Hankui Zhuo

We propose a variant of the Rapidly Exploring Random Tree Star (RRT$^{\star}$) algorithm to synthesize trajectories satisfying a given spatio-temporal specification expressed in a fragment of Signal Temporal Logic (STL) for linear systems.…

Systems and Control · Electrical Eng. & Systems 2025-06-13 Gregorio Marchesini , Siyuan Liu , Lars Lindemann , Dimos V. Dimarogonas

Contact planning is crucial in locomoting systems.Specifically, appropriate contact planning can enable versatile behaviors (e.g., sidewinding in limbless locomotors) and facilitate speed-dependent gait transitions (e.g., walk-trot-gallop…

We study a spatiotemporal service matching problem in which demand, heterogeneous in location and time sensitivity/preference, is to be assigned to service stations. The planner seeks to maximize social welfare, defined as total service…

Theoretical Economics · Economics 2026-03-17 Mingyang Fu , Ming Hu

We study rotation-robust learning for image inputs using Convolutional Model Trees (CMTs) [1], whose split and leaf coefficients can be structured on the image grid and transformed geometrically at deployment time. In a controlled MNIST…

Computer Vision and Pattern Recognition · Computer Science 2026-01-09 Hongyi Li , William Ward Armstrong , Jun Xu

This study presents a system integration approach for planning schedules, sequences, tasks, and motions for reconfigurable robots to automatically disassemble constrained structures in a non-destructive manner. Such systems must adapt their…

Robotics · Computer Science 2025-09-19 Takuya Kiyokawa , Tomoki Ishikura , Shingo Hamada , Genichiro Matsuda , Kensuke Harada

Stereotactic radiosurgery is an effective technique to treat brain tumors for which several inverse planning methods may be appropriate. We propose an integer programming model to simultaneous sector duration and isocenter optimization…

Robots often need to solve path planning problems where essential and discrete aspects of the environment are partially observable. This introduces a multi-modality, where the robot must be able to observe and infer the state of its…

Robotics · Computer Science 2022-08-02 Camille Phiquepal , Andreas Orthey , Nicolas Viennot , Marc Toussaint

Solving multi-robot motion planning (MRMP) requires generating collision-free kinodynamically feasible trajectories for multiple interacting robots. We introduce Kinodynamic Translation-Invariant Edge Bundles or KiTE-Extend, a…

Decision trees are widely used for classification and regression tasks in a variety of application fields due to their interpretability and good accuracy. During the past decade, growing attention has been devoted to globally optimized…

Machine Learning · Computer Science 2025-01-28 Antonio Consolo , Edoardo Amaldi , Andrea Manno

Stochastic Gradient Descent (SGD) has proven to be remarkably effective in optimizing deep neural networks that employ ever-larger numbers of parameters. Yet, improving the efficiency of large-scale optimization remains a vital and highly…

Machine Learning · Computer Science 2020-11-11 Frithjof Gressmann , Zach Eaton-Rosen , Carlo Luschi

This paper presents several new tractability results for planning based on macros. We describe an algorithm that optimally solves planning problems in a class that we call inverted tree reducible, and is provably tractable for several…

Artificial Intelligence · Computer Science 2014-01-16 Anders Jonsson

Neuromorphic vision sensors (event cameras) simulate biological visual perception systems and have the advantages of high temporal resolution, less data redundancy, low power consumption, and large dynamic range. Since both events and…

Computer Vision and Pattern Recognition · Computer Science 2023-03-15 Haibo Shen , Juyu Xiao , Yihao Luo , Xiang Cao , Liangqi Zhang , Tianjiang Wang

We study the convergence of the predictive surface of regression trees and forests. To support our analysis we introduce a notion of adaptive concentration for regression trees. This approach breaks tree training into a model selection…

Statistics Theory · Mathematics 2016-05-03 Stefan Wager , Guenther Walther

We propose and analyse numerical schemes for a system of quasilinear, degenerate evolution equations modelling biofilm growth as well as other processes such as flow through porous media and the spreading of wildfires. The first equation in…

Numerical Analysis · Mathematics 2024-04-05 R. K. H. Smeets , K. Mitra , I. S. Pop , S. Sonner

Planning the motion path for a tightly coupled dual-arm space manipulator under closed-chain constraints is a fundamental yet challenging problem in on-orbit assembly of large-scale space structures. The closed-chain constraints…

Robotics · Computer Science 2026-05-27 Jiawei Zhang , Xinhao Miao , Jifeng Guo , Qinghua Li , Chengchao Bai

This paper proposes a new sampling-based kinodynamic motion planning algorithm, called FMT*PFF, for nonlinear systems. It exploits the novel idea of dimensionality reduction using partial-final-state-free (PFF) optimal controllers.With the…

Robotics · Computer Science 2023-06-06 Dongliang Zheng , Panagiotis Tsiotras

A technique for improving the prediction accuracy of decision trees is proposed. It consists in evaluating the tree's branches in parallel over multiple paths. The technique enables predictions that are more aligned with the ones generated…

Machine Learning · Computer Science 2022-02-25 Cristian Alb