Accelerating continuous grasp with a gpu
This work proposes a GPU-based parallelization for the Continuous GRASP (C-GRASP), a
local search metaheuristic for finding cost-efficient solutions to continuous global …
local search metaheuristic for finding cost-efficient solutions to continuous global …
A navigation framework for mobile robots with 3D LiDAR and monocular camera
X Meng, J Cai, Y Wu, S Liang, Z Cao… - IECON 2018-44th …, 2018 - ieeexplore.ieee.org
This paper presents a navigation framework for mobile robots. In order to traverse in different
environments, mobile robots have to avoid obstacles it encountered and make a suitable …
environments, mobile robots have to avoid obstacles it encountered and make a suitable …
Bounding algorithms for persistent monitoring of targets using unmanned vehicles
Persistent monitoring of targets in civil and military applications require a team of Unmanned
Vehicles to visit the targets repeatedly over time. The vehicles visit the targets and transmit …
Vehicles to visit the targets repeatedly over time. The vehicles visit the targets and transmit …
[PDF][PDF] Experiment-based performance improvement of state feedback control systems for single input processes
Interruption is occurred by partial participation of workflows with adding new activity to a
worker. A concerned worker to the interrupted workflow must restructure task assignment to …
worker. A concerned worker to the interrupted workflow must restructure task assignment to …
An approximation algorithm for a shortest dubins path problem
S Rathinam, P Khargonekar - Dynamic Systems …, 2016 - asmedigitalcollection.asme.org
The problem of finding the shortest path for a vehicle visiting a given sequence of target
points subject to the motion constraints of the vehicle is an important problem that arises in …
points subject to the motion constraints of the vehicle is an important problem that arises in …
Dynamic region visit routing problem for vehicles with minimum turning radius
DG Macharet, A Alves Neto, VF da Camara Neto… - Journal of …, 2018 - Springer
In this paper we address the problem of planning optimized routes among dynamically
selected target regions for vehicles with a turning radius motion constraint, hereinafter called …
selected target regions for vehicles with a turning radius motion constraint, hereinafter called …
Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks
This paper formalises path planning problem for a group of heterogeneous Dubins vehicles
performing tasks in a remote fashion and develops a memetic algorithm-based method to …
performing tasks in a remote fashion and develops a memetic algorithm-based method to …
Robotic jigsaw: A non-holonomic cutting robot and path planning algorithm
H Zhao, Y Talwekar, W Lan, C Sharma… - 2021 IEEE/RSJ …, 2021 - ieeexplore.ieee.org
Bladed tools such as jigsaws are common tools for wood workers on job-sites and in
workshops, but do not currently have sufficient autonomous hardware or path planning …
workshops, but do not currently have sufficient autonomous hardware or path planning …
Time-Optimized Routing Problem for Vehicles with Bounded Curvature
DG Macharet, JWG Monteiro… - 2016 XIII Latin …, 2016 - ieeexplore.ieee.org
In this paper we introduce the k-Dubins TSP (k-DTSP), the problem of planning efficient
paths among a set of points of interest in the environment for multiple robots with bounded …
paths among a set of points of interest in the environment for multiple robots with bounded …
[PDF][PDF] Efficient approaches to cleaning with mobile robots
JM Hess - 2015 - freidok.uni-freiburg.de
In the future, service robots are expected to perform many useful tasks in domestic
environments such as cleaning or tidying up. If they performed these tasks autonomously …
environments such as cleaning or tidying up. If they performed these tasks autonomously …