{"paper":{"title":"Evacuating Equilateral Triangles and Squares in the Face-to-Face Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Huda Chuangpishit, Jaroslav Opatrny, Lata Narayanan, Saeed Mehrabi","submitted_at":"2018-12-25T19:40:49Z","abstract_excerpt":"Consider $k$ robots initially located at a point inside a region $T$. Each robot can move anywhere in $T$ independently of other robots with maximum speed one. The goal of the robots is to \\emph{evacuate} $T$ through an exit at an unknown location on the boundary of $T$. The objective is to minimize the \\emph{evacuation time}, which is defined as the time the \\emph{last} robot reaches the exit. We consider the \\emph{face-to-face} communication model for the robots: a robot can communicate with another robot only when they meet in $T$.\n  In this paper, we give upper and lower bounds for the fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10162","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}