Related papers: Ice sliding games
Simple stochastic games can be solved by value iteration (VI), which yields a sequence of under-approximations of the value of the game. This sequence is guaranteed to converge to the value only in the limit. Since no stopping criterion is…
We analyze inertial coordination games: dynamic coordination games with an endogenously changing state that depends on (i) a persistent fundamental players privately learn about over time; and (ii) past play. The speed of learning…
Grip, walk, crawl, and jump. Soft robots are integrated functional structures composed of compliant mechanisms, whose activity spans various industrial applications such as surgery, healthcare, surveillance, and even planetary exploration.…
A Differential Drive Robot (DDR) located inside a circular detection region in the plane wants to escape from it in minimum time. Various robotics applications can be modeled like the previous problem, such as a DDR escaping as soon as…
Design of robots at the small scale is a trial-and-error based process, which is costly and time-consuming. There are few dynamic simulation tools available to accurately predict the motion or performance of untethered microrobots as they…
The parallel chip-firing game is an automaton on graphs in which vertices "fire" chips to their neighbors when they have enough chips to do so. The game is always periodic, and we concern ourselves with the firing sequences of vertices. We…
We demonstrate that the free motion of any two-dimensional rigid body colliding elastically with two parallel, flat walls is equivalent to a billiard system. Using this equivalence, we analyze the integrable and chaotic properties of this…
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the most popular types of sporting competitions in polynomial…
This article introduces GeoBotsVR, an easily accessible virtual reality game that combines elements of puzzle-solving with robotics learning and aims to cultivate interest and motivation in robotics, programming, and electronics among…
We study the class of reach-avoid dynamic games in which multiple agents interact noncooperatively, and each wishes to satisfy a distinct target criterion while avoiding a failure criterion. Reach-avoid games are commonly used to express…
This project aims to motivate research in competitive human-robot interaction by creating a robot competitor that can challenge human users in certain scenarios such as physical exercise and games. With this goal in mind, we introduce the…
We study a simple motion differential game of many pursuers and one evader in the plane. We give a nonempty closed convex set in the plane, and the pursuers and evader move on this set. They cannot leave this set during the game. Control…
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…
Priced timed games are optimal-cost reachability games played between two players---the controller and the environment---by moving a token along the edges of infinite graphs of configurations of priced timed automata. The goal of the…
Chip-firing is a combinatorial game played on a graph, in which chips are placed and dispersed on the vertices until a stable configuration is achieved. We study a chip-firing variant on an infinite, rooted directed $k$-ary tree, where we…
The dynamics of three soft interacting particles on a ring is shown to correspond to the motion of one particle inside a soft triangular billiard. The dynamics inside the soft billiard depends only on the {\it masses ratio} between…
In this work we propose and study a realization of an artificial spin ice-like system, not based on any real material, in a triangular geometry. At each vertex of the lattice, the "ice-like rule" dictates that three spins must point inward…
This paper studies a stochastic robotic surveillance problem where a mobile robot moves randomly on a graph to capture a potential intruder that strategically attacks a location on the graph. The intruder is assumed to be omniscient: it…
This paper deals with the classical problem of exploring a ring by a cohort of synchronous robots. We focus on the perpetual version of this problem in which it is required that each node of the ring is visited by a robot infinitely often.…
This paper concerns two algorithms for solving optimal control problems with hybrid systems. The first algorithm aims at hybrid systems exhibiting sliding modes. The first algorithm has several features which distinguishes it from the other…