425 citations · 1.8k across the 99 of their papers we have counts for
7 papers · 1 filter
A new method for proving confluence on abstract reduction systems --- Confluence of non-E-overlapping weakly-shallow TRSs ---
Masahiko Sakai, Mizuhito Ogawa, Michio Oyamaguchi
This paper proposes a new method for proving the confluence of an abstract reduction system (ARS) by clarifying the sufficient conditions, called compatibility and edge commutativi…
DeformX: A Versatile Co-Simulation Framework for Deformable Linear Objects
Yi Yang, Xiang Fei, Lehong Wang +5
Deformable linear objects (DLOs) such as wires, cables, and ropes are common in robotic manipulation tasks, yet simulating them with both visual realism and physical accuracy remai…
Two-Phase Bilevel Search for the Moving-Target Traveling Salesman Problem with Moving Obstacles
Allen George Philip, Anoop Bhat, Sivakumar Rathinam +1
The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a minimum cost trajectory for an agent that departs from a static depot, visits a set of moving targets, each within one…
Optimal Solutions for the Moving Target Vehicle Routing Problem via Branch-and-Price with Relaxed Continuity
Anoop Bhat, Geordan Gutow, Zhongqiang Ren +2
The Moving Target Vehicle Routing Problem (MT-VRP) seeks trajectories for several agents that intercept a set of moving targets, subject to speed, time window, and capacity constra…
System Design of the Ultra Mobility Vehicle: A Driving, Balancing, and Jumping Bicycle Robot
Benjamin Bokser, Daniel Gonzalez, Aaron Preston +39
Trials cyclists and mountain bike riders can hop, jump, balance, and drive on one or both wheels. This versatility allows them to achieve speed and energy-efficiency on smooth terr…
Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch-and-Price
Anoop Bhat, Geordan Gutow, David Neiman +4
The Moving Target Vehicle Routing Problem with Obstacles (MT-VRP-O) seeks trajectories for several agents that collectively intercept a set of moving targets. Each target has one o…
RPT*: Global Planning with Probabilistic Terminals for Target Search in Complex Environments
Yunpeng Lyu, Chao Cao, Ji Zhang +2
Routing problems such as Hamiltonian Path Problem (HPP), seeks a path to visit all the vertices in a graph while minimizing the path cost. This paper studies a variant, HPP with Pr…