{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:03:12Z","timestamp":1648551792514},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,9]]},"abstract":" Bouncing robots are mobile agents with limited sensing capabilities adjusting their movements upon collisions either with other robots or obstacles in the environment. They behave like elastic particles sliding on a cycle or a segment. When two of them collide, they instantaneously update their velocities according to the laws of classical mechanics for elastic collisions. They have no control on their movements which are determined only by their masses, velocities, and upcoming sequence of collisions. We suppose that a robot arriving for the second time to its initial position dies instantaneously. We study the survivability of collections of swarms of bouncing robots. More exactly, we are looking for subsets of swarms such that after some initial bounces which may result in some robots dying, the surviving subset of the swarm continues its bouncing movement, with no robot reaching its initial position. For the case of robots of equal masses and speeds we prove that all robots bouncing in the segment must always die while there are configurations of robots on the cycle with surviving subsets. We show the smallest such configuration containing four robots with two survivors. We show that any collection of less than four robots must always die. On the other hand, we show that [Formula: see text] robots always die where [Formula: see text] (and [Formula: see text]) is the number of robots starting their movements in clockwise (respectively, counterclockwise) direction in swarm [Formula: see text]. When robots bouncing on a cycle or a segment have arbitrary masses we show that at least one robot must always die. Further, we show that in either environment it is possible to construct swarms with [Formula: see text] survivors. We prove, however, that the survivors in the segment must remain static indefinitely while in the case of the cycle it is possible to have surviving collections with strictly positive kinetic energy. <\/jats:p>","DOI":"10.1142\/s1793830916500427","type":"journal-article","created":{"date-parts":[[2016,4,26]],"date-time":"2016-04-26T08:37:36Z","timestamp":1461659856000},"page":"1650042","source":"Crossref","is-referenced-by-count":0,"title":["Survivability of bouncing robots"],"prefix":"10.1142","volume":"08","author":[{"given":"J.","family":"Czyzowicz","sequence":"first","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, Qu\u00e9bec, J8X 3X7, Canada"}]},{"given":"S.","family":"Dobrev","sequence":"additional","affiliation":[{"name":"Slovak Academy of Sciences, 840 00 Bratislava, Slovak Republic"}]},{"given":"E.","family":"Kranakis","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, Ontario K1S 5B6, Canada"}]},{"given":"Eduardo","family":"Pacheco","sequence":"additional","affiliation":[{"name":"Oracle, Zapopan, Jalisco, 45116, Mexico"}]}],"member":"219","published-online":{"date-parts":[[2016,8]]},"reference":[{"key":"S1793830916500427BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"S1793830916500427BIB003","doi-asserted-by":"publisher","DOI":"10.1070\/RD2004v009n03ABEH000276"},{"key":"S1793830916500427BIB004","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342658X"},{"key":"S1793830916500427BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2015.07.005"},{"key":"S1793830916500427BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0234-3"},{"key":"S1793830916500427BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1232-z"},{"key":"S1793830916500427BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/BF02181254"},{"key":"S1793830916500427BIB011","doi-asserted-by":"publisher","DOI":"10.1063\/1.1704288"},{"key":"S1793830916500427BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/BF02188582"},{"key":"S1793830916500427BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/BF01049961"},{"issue":"2","key":"S1793830916500427BIB014","doi-asserted-by":"crossref","first-page":"137","DOI":"10.26493\/1855-3974.25.7bd","volume":"1","author":"Rosenfeld M.","year":"2008","journal-title":"Ars Math. Contemp."},{"key":"S1793830916500427BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/BF01074110"},{"key":"S1793830916500427BIB017","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979628292X"},{"key":"S1793830916500427BIB018","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.50.955"},{"key":"S1793830916500427BIB020","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.86.026601"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:44:04Z","timestamp":1565113444000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":15,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2016,8]]},"published-print":{"date-parts":[[2016,9]]}},"alternative-id":["10.1142\/S1793830916500427"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500427","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}