Vis enkel innførsel

dc.contributor.authorDharmadhikari, Mihir
dc.contributor.authorDeshpande, Harshal
dc.contributor.authorDang, Tung
dc.contributor.authorAlexis, Konstantinos
dc.date.accessioned2022-02-15T10:26:10Z
dc.date.available2022-02-15T10:26:10Z
dc.date.created2021-11-24T12:51:55Z
dc.date.issued2021
dc.identifier.isbn978-1-7281-9077-8
dc.identifier.urihttps://hdl.handle.net/11250/2979051
dc.description.abstractIn this work, we present an adaptive behavior path planning method for autonomous exploration and visual search of unknown environments. As volumetric exploration and visual coverage of unknown environments, with possibly different sensors, are non-identical objectives, a principled combination of the two is proposed. In particular, the method involves three distinct planning policies, namely exploration, and sparse or dense visual coverage. A hypergame formulation is proposed which allows the robot to select for the next-best planning behavior in response to the currently encountered environment challenges in terms of geometry and visual conditions, alongside a self-assessment of its performance. The proposed planner is evaluated in a collection of experimental and simulation studies in diverse environments, while comparative results against a state-of-the-art exploration method are also presented.en_US
dc.language.isoengen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.ispartof2021 IEEE International Conference on Robotics and Automation (ICRA)
dc.relation.urihttps://ieeexplore.ieee.org/document/9561451
dc.titleHypergame-based Adaptive Behavior Path Planning for Combined Exploration and Visual Searchen_US
dc.typeChapteren_US
dc.description.versionacceptedVersionen_US
dc.rights.holder© IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en_US
dc.source.pagenumber269-275en_US
dc.identifier.doi10.1109/ICRA48506.2021.9561451
dc.identifier.cristin1958374
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.qualitycode1


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel