activity
20132023
most citedSimplicial Complexity: piecewise linear motion planning in robotics

12 citations · 19 across the 4 of their papers we have counts for

collaborators

5 papers

math.AT2023

An algorithmic discrete gradient field for non-colliding cell-like objects and the topology of pairs of points on skeleta of simplexes

Emilio J. Gonzalez, Jesus Gonzalez

For a positive integer and a finite simplicial complex , we describe an algorithmic procedure constructing a maximal discrete gradient field on Abrams' discretized…

math.AT2020

A randomized greedy algorithm for piecewise linear motion planning

Carlos Ortiz, Adriana Lara, Jesus Gonzalez +1

We describe and implement a randomized algorithm that inputs a polyhedron, thought of as the space of states of some automated guided vehicle , and outputs an explicit…

cs.RO2019★ 6 cited

Multitasking collision-free motion planning algorithms in Euclidean spaces

Cesar A. Ipanaque Zapata, Jesus Gonzalez

We present optimal motion planning algorithms which can be used in designing practical systems controlling objects moving in Euclidean space without collisions. Our algorithms are…

math.AT2017★ 12 cited

Simplicial Complexity: piecewise linear motion planning in robotics

Jesús González

Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex ,…

math.AT2013★ 1 cited

Sequential motion planning of non-colliding particles in Euclidean spaces

Jesus Gonzalez, Mark Grant

In terms of Rudyak's generalization of Farber's topological complexity of the path motion planning problem in robotics, we give a complete description of the topological instabilit…