Show simple item record

dc.contributor.convenorCOREen_AU
dc.contributor.authorFenwick, Joelen_US
dc.contributor.authorEstivill-Castro, Vladimiren_US
dc.contributor.editorGillian Dobbieen_US
dc.date.accessioned2017-04-24T11:31:06Z
dc.date.available2017-04-24T11:31:06Z
dc.date.issued2007en_US
dc.date.modified2008-11-06T23:04:09Z
dc.identifier.doihttp://www.se.auckland.ac.nz/acsc07/en_AU
dc.identifier.urihttp://hdl.handle.net/10072/17247
dc.description.abstractAs computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much work has been done on this problem with a single entity in a continuous environment. However these entities may be in teams and their actions may be constrained by the need to consider the actions of other entities. We consider the case of two entities wishing to reach their destinations while travelling the minimum distance and remaining in sight of each other. A version of this problem in continuous space has been addressed previously; however, the problem of minimum length paths does not only exist in continuous space. Robots may have restricted orientations in movement. Also, domains such as circuit design and computer games require discrete movements and restricted orientation. The restricted orientation and the fact that (even in genus zero environments) minimal length paths may not be unique present some challenges. This paper investigates the problem of two entities in a discrete setting, moving to preserve visibility and provides algorithms for computing schedules that minimise the total distance travelleden_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.format.extent347904 bytes
dc.format.extent60421 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherAustralian Computer Societyen_US
dc.publisher.placeBallarat, Australiaen_US
dc.publisher.urihttp://www.acs.org.au/en_AU
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofconferencenameThirtieth Australasian Computer Science Conference (ACSC2007)en_US
dc.relation.ispartofconferencetitleComputer Science 2007 : Proceedings of the Thirtieth Australasian Computer Science Conference (ACSC2007), Ballarat, victoria, Australia, January 30 to Febrary 2, 2007en_US
dc.relation.ispartofdatefrom2007-01-30en_US
dc.relation.ispartofdateto2007-02-02en_US
dc.relation.ispartoflocationBallarat, Australiaen_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchcode280401en_US
dc.titleMutually Visible Agents in a Discrete Environmenten_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.rights.copyrightCopyright 2007 Australian Computer Society Inc. The attached file is reproduced here in accordance with the copyright policy of the publisher. Use hypertext link for access to the conference website.en_AU
gro.date.issued2007
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record