Zobrazeno 1 - 10
of 150
pro vyhledávání: '"Kostitsyna Irina"'
Autor:
Team, MIT--NASA Space Robots, Brunner, Josh, Cheung, Kenneth C., Demaine, Erik D., Diomidova, Jenny, Gregg, Christine, Hendrickson, Della H., Kostitsyna, Irina
We introduce and analyze a model for self-reconfigurable robots made up of unit-cube modules. Compared to past models, our model aims to newly capture two important practical aspects of real-world robots. First, modules often do not occupy an exact u
Externí odkaz:
http://arxiv.org/abs/2405.15724
Autor:
Kostitsyna, Irina, Ophelders, Tim, Parada, Irene, Peters, Tom, Sonke, Willem, Speckmann, Bettina
The sliding cubes model is a well-established theoretical framework that supports the analysis of reconfiguration algorithms for modular robots consisting of face-connected cubes. The best algorithm currently known for the reconfiguration problem, by
Externí odkaz:
http://arxiv.org/abs/2312.15096
Motivated by the prospect of nano-robots that assist human physiological functions at the nanoscale, we investigate the coating problem in the three-dimensional model for hybrid programmable matter. In this model, a single agent with strictly limited
Externí odkaz:
http://arxiv.org/abs/2303.16180
Publikováno v:
E3S Web of Conferences, Vol 121, p 04006 (2019)
Carbon and low-alloy steels, which constitute the main volume of pipe production, are unstable to the action of aggressive mineralized oil fields environments, which are often in the late stage of development. Recently, attempts have been made to use
Externí odkaz:
https://doaj.org/article/80bf451b2d6d4c4ca3e73cd177f06751
Autor:
Buchin, Kevin, Evans, Will, Frati, Fabrizio, Kostitsyna, Irina, Löffler, Maarten, Ophelders, Tim, Wolff, Alexander
In this paper, we investigate crossing-free 3D morphs between planar straight-line drawings. We show that, for any two (not necessarily topologically equivalent) planar straight-line drawings of an $n$-vertex planar graph, there exists a piecewise-li
Externí odkaz:
http://arxiv.org/abs/2210.05384
Autor:
Banyassady, Bahareh, de Berg, Mark, Bringmann, Karl, Buchin, Kevin, Fernau, Henning, Halperin, Dan, Kostitsyna, Irina, Okamoto, Yoshio, Slot, Stijn
We consider the unlabeled motion-planning problem of $m$ unit-disc robots moving in a simple polygonal workspace of $n$ edges. The goal is to find a motion plan that moves the robots to a given set of $m$ target positions. For the unlabeled variant,
Externí odkaz:
http://arxiv.org/abs/2205.07777
Autor:
Buchin, Kevin, Flocchini, Paola, Kostitsyna, Irina, Peters, Tom, Santoro, Nicola, Wada, Koichi
We consider distributed systems of identical autonomous computational entities, called robots, moving and operating in the plane in synchronous Look-Compute-Move (LCM) cycles. The algorithmic capabilities of these systems have been extensively invest
Externí odkaz:
http://arxiv.org/abs/2203.06546
Autor:
Hagedoorn, Mart, Kostitsyna, Irina
We study the problem of finding the shortest path with increasing chords in a simple polygon. A path has increasing chords if and only if for any points a, b, c, and d that lie on the path in that order, |ad| >= |bc|. In this paper we show that the s
Externí odkaz:
http://arxiv.org/abs/2202.12131
The concept of programmable matter envisions a very large number of tiny and simple robot particles forming a smart material. Even though the particles are restricted to local communication, local movement, and simple computation, their actions can n
Externí odkaz:
http://arxiv.org/abs/2202.11663