Zobrazeno 1 - 10
of 716
pro vyhledávání: '"Fekete Sándor"'
Autor:
Akitaya, Hugo A., Fekete, Sándor P., Kramer, Peter, Molaei, Saba, Rieck, Christian, Stock, Frederick, Wallner, Tobias
We consider algorithmic problems motivated by modular robotic reconfiguration, for which we are given $n$ square-shaped modules (or robots) in a (labeled or unlabeled) start configuration and need to find a schedule of sliding moves to transform it i
Externí odkaz:
http://arxiv.org/abs/2412.05523
Autor:
Fekete, Sándor P., Kosfeld, Ramin, Kramer, Peter, Neutzner, Jonas, Rieck, Christian, Scheffer, Christian
We study Multi-Agent Path Finding for arrangements of labeled agents in the interior of a simply connected domain: Given a unique start and target position for each agent, the goal is to find a sequence of parallel, collision-free agent motions that
Externí odkaz:
http://arxiv.org/abs/2409.06486
Autor:
Becker, Aaron T., Fekete, Sándor P., Huang, Li, Keldenich, Phillip, Kleist, Linda, Krupke, Dominik, Rieck, Christian, Schmidt, Arne
We investigate algorithmic approaches for targeted drug delivery in a complex, maze-like environment, such as a vascular system. The basic scenario is given by a large swarm of micro-scale particles (''agents'') and a particular target region (''tumo
Externí odkaz:
http://arxiv.org/abs/2408.09729
Autor:
Fekete, Sándor P., Mitchell, Joseph S. B., Rieck, Christian, Scheffer, Christian, Schmidt, Christiane
We study the Dispersive Art Gallery Problem with vertex guards: Given a polygon $\mathcal{P}$, with pairwise geodesic Euclidean vertex distance of at least $1$, and a rational number $\ell$; decide whether there is a set of vertex guards such that $\
Externí odkaz:
http://arxiv.org/abs/2406.05861
We give an overview of the 2024 Computational Geometry Challenge targeting the problem \textsc{Maximum Polygon Packing}: Given a convex region $P$ in the plane, and a collection of simple polygons $Q_1, \ldots, Q_n$, each $Q_i$ with a respective valu
Externí odkaz:
http://arxiv.org/abs/2403.16203
Autor:
Ammann, Sabrina, Hess, Maximilian, Ramacciotti, Debora, Fekete, Sándor P., Goedicke, Paulina L. A., Gross, David, Lefterovici, Andreea, Osborne, Tobias J., Perk, Michael, Rotundo, Antonio, Skelton, S. E., Stiller, Sebastian, de Wolff, Timo
In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic worst-case bounds. Can we expect this to have consequences for Linear and
Externí odkaz:
http://arxiv.org/abs/2311.09995
Autor:
Wilkening, Sören, Lefterovici, Andreea-Iulia, Binkowski, Lennart, Perk, Michael, Fekete, Sándor, Osborne, Tobias J.
Here we present two novel contributions for achieving quantum advantage in solving difficult optimisation problems, both in theory and foreseeable practice. (1) We introduce the "Quantum Tree Generator", an approach to generate in superposition all f
Externí odkaz:
http://arxiv.org/abs/2310.06623
For a given polygonal region $P$, the Lawn Mowing Problem (LMP) asks for a shortest tour $T$ that gets within Euclidean distance 1/2 of every point in $P$; this is equivalent to computing a shortest tour for a unit-diameter cutter $C$ that covers all
Externí odkaz:
http://arxiv.org/abs/2307.01092
We give an overview of the 2023 Computational Geometry Challenge targeting the problem Minimum Coverage by Convex Polygons, which consists of covering a given polygonal region (possibly with holes) by a minimum number of convex subsets, a problem wit
Externí odkaz:
http://arxiv.org/abs/2303.07007
Autor:
Garcia, Javier, Yannuzzi, Michael, Kramer, Peter, Rieck, Christian, Fekete, Sándor P., Becker, Aaron T.
We present progress on the problem of reconfiguring a 2D arrangement of building material by a cooperative group of robots. These robots must avoid collisions, deadlocks, and are subjected to the constraint of maintaining connectivity of the structur
Externí odkaz:
http://arxiv.org/abs/2211.09198