loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Yaniv Altshuler 1 ; Alfred M. Bruckstein 2 and Israel A. Wagner 3

Affiliations: 1 Deutsche Telekom Laboratories, Ben Gurion University, Israel ; 2 Israel Institute of Technology, Israel ; 3 IBM Haifa Research Labs, Israel

Keyword(s): Swarm algorithm, Decentralized search, Cooperative exploration, Grid exploration, Time complexity.

Related Ontology Subjects/Areas/Topics: Autonomous Agents ; Distributed Control Systems ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Mobile Robots and Autonomous Systems ; Robotics and Automation ; Software Agents for Intelligent Control Systems

Abstract: This work discusses the problem of exploration of an unknown environment using a collaborative group of simple agents. While this problem was known to be of a non-polynomial time complexity, it was speculated in the past that in grid domains the completion time of this problem is much lower (although analytic proofs were not available hitherto). In this work we present a preliminary result concerning a constructive analytic constraint for guaranteeing that the time complexity of this problem in grid domains is indeed polynomial.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.138.170.67

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Altshuler, Y.; M. Bruckstein, A. and A. Wagner, I. (2009). COLLABORATIVE EXPLORATION IN GRID DOMAINS - Constructive Conjecture of a Polynomial Time Complexity. In Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO; ISBN 978-989-8111-99-9; ISSN 2184-2809, SciTePress, pages 252-257. DOI: 10.5220/0002214402520257

@conference{icinco09,
author={Yaniv Altshuler. and Alfred {M. Bruckstein}. and Israel {A. Wagner}.},
title={COLLABORATIVE EXPLORATION IN GRID DOMAINS - Constructive Conjecture of a Polynomial Time Complexity},
booktitle={Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO},
year={2009},
pages={252-257},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002214402520257},
isbn={978-989-8111-99-9},
issn={2184-2809},
}

TY - CONF

JO - Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO
TI - COLLABORATIVE EXPLORATION IN GRID DOMAINS - Constructive Conjecture of a Polynomial Time Complexity
SN - 978-989-8111-99-9
IS - 2184-2809
AU - Altshuler, Y.
AU - M. Bruckstein, A.
AU - A. Wagner, I.
PY - 2009
SP - 252
EP - 257
DO - 10.5220/0002214402520257
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic