FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4313639219> ?p ?o ?g. }

• W4313639219 endingPage "2077" @default.
• W4313639219 startingPage "2060" @default.
• W4313639219 abstract "The multiple-path orienteering problem asks for paths for a team of robots that maximize the total reward collected while satisfying budget constraints on the path length. This problem models many multirobot routing tasks, such as exploring unknown environments and information gathering for environmental monitoring. In this article, we focus on how to make the robot team robust to failures when operating in adversarial environments. We introduce the robust multiple-path orienteering problem (RMOP), where we seek worst case guarantees against an adversary that is capable of attacking at most <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink><tex-math notation=LaTeX>$alpha$</tex-math></inline-formula> robots. We consider two versions of this problem: RMOP offline and RMOP online. In the offline version, there is no communication or replanning when robots execute their plans, and our main contribution is a general approximation scheme with a bounded approximation guarantee that depends on <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink><tex-math notation=LaTeX>$alpha$</tex-math></inline-formula> and the approximation factor for single-robot orienteering. In particular, we show that the algorithm yields a: 1) constant-factor approximation when the cost function is modular; 2) <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink><tex-math notation=LaTeX>$log$</tex-math></inline-formula> factor approximation when the cost function is submodular; and 3) constant-factor approximation when the cost function is submodular, but the robots are allowed to exceed their path budgets by a bounded amount. In the online version, the RMOP is modeled as a two-player sequential game and solved adaptively in a receding horizon fashion based on Monte Carlo tree search. In addition to theoretical analysis, we perform simulation studies for ocean monitoring and tunnel information-gathering applications to demonstrate the efficacy of our approach." @default.
• W4313639219 created "2023-01-07" @default.
• W4313639219 creator A5017567994 @default.
• W4313639219 creator A5041045546 @default.
• W4313639219 creator A5086188394 @default.
• W4313639219 date "2023-06-01" @default.
• W4313639219 modified "2023-09-30" @default.
• W4313639219 title "Robust Multiple-Path Orienteering Problem: Securing Against Adversarial Attacks" @default.
• W4313639219 cites W1562003885 @default.
• W4313639219 cites W1625390266 @default.
• W4313639219 cites W1981174120 @default.
• W4313639219 cites W2022149436 @default.
• W4313639219 cites W2051384576 @default.
• W4313639219 cites W2073110021 @default.
• W4313639219 cites W2105933141 @default.
• W4313639219 cites W2113873983 @default.
• W4313639219 cites W2126316555 @default.
• W4313639219 cites W2148026779 @default.
• W4313639219 cites W2151239055 @default.
• W4313639219 cites W2153233841 @default.
• W4313639219 cites W2396961959 @default.
• W4313639219 cites W2495591843 @default.
• W4313639219 cites W2531699011 @default.
• W4313639219 cites W2572839999 @default.
• W4313639219 cites W2574318813 @default.
• W4313639219 cites W2604420937 @default.
• W4313639219 cites W2774807875 @default.
• W4313639219 cites W2791580684 @default.
• W4313639219 cites W2891317153 @default.
• W4313639219 cites W2902183398 @default.
• W4313639219 cites W2956013814 @default.
• W4313639219 cites W2962907715 @default.
• W4313639219 cites W2963360571 @default.
• W4313639219 cites W2963918661 @default.
• W4313639219 cites W2964175192 @default.
• W4313639219 cites W2964302474 @default.
• W4313639219 cites W2985558354 @default.
• W4313639219 cites W3040162929 @default.
• W4313639219 cites W3089748765 @default.
• W4313639219 cites W3099664902 @default.
• W4313639219 cites W3123069145 @default.
• W4313639219 doi "https://doi.org/10.1109/tro.2022.3232268" @default.
• W4313639219 hasPublicationYear "2023" @default.
• W4313639219 type Work @default.
• W4313639219 citedByCount "0" @default.
• W4313639219 crossrefType "journal-article" @default.
• W4313639219 hasAuthorship W4313639219A5017567994 @default.
• W4313639219 hasAuthorship W4313639219A5041045546 @default.
• W4313639219 hasAuthorship W4313639219A5086188394 @default.
• W4313639219 hasBestOaLocation W43136392192 @default.
• W4313639219 hasConcept C11413529 @default.
• W4313639219 hasConcept C126255220 @default.
• W4313639219 hasConcept C134306372 @default.
• W4313639219 hasConcept C14036430 @default.
• W4313639219 hasConcept C148764684 @default.
• W4313639219 hasConcept C154945302 @default.
• W4313639219 hasConcept C178621042 @default.
• W4313639219 hasConcept C199360897 @default.
• W4313639219 hasConcept C2777735758 @default.
• W4313639219 hasConcept C33923547 @default.
• W4313639219 hasConcept C34388435 @default.
• W4313639219 hasConcept C41008148 @default.
• W4313639219 hasConcept C45357846 @default.
• W4313639219 hasConcept C513932644 @default.
• W4313639219 hasConcept C78458016 @default.
• W4313639219 hasConcept C80444323 @default.
• W4313639219 hasConcept C86803240 @default.
• W4313639219 hasConcept C90509273 @default.
• W4313639219 hasConcept C94375191 @default.
• W4313639219 hasConceptScore W4313639219C11413529 @default.
• W4313639219 hasConceptScore W4313639219C126255220 @default.
• W4313639219 hasConceptScore W4313639219C134306372 @default.
• W4313639219 hasConceptScore W4313639219C14036430 @default.
• W4313639219 hasConceptScore W4313639219C148764684 @default.
• W4313639219 hasConceptScore W4313639219C154945302 @default.
• W4313639219 hasConceptScore W4313639219C178621042 @default.
• W4313639219 hasConceptScore W4313639219C199360897 @default.
• W4313639219 hasConceptScore W4313639219C2777735758 @default.
• W4313639219 hasConceptScore W4313639219C33923547 @default.
• W4313639219 hasConceptScore W4313639219C34388435 @default.
• W4313639219 hasConceptScore W4313639219C41008148 @default.
• W4313639219 hasConceptScore W4313639219C45357846 @default.
• W4313639219 hasConceptScore W4313639219C513932644 @default.
• W4313639219 hasConceptScore W4313639219C78458016 @default.
• W4313639219 hasConceptScore W4313639219C80444323 @default.
• W4313639219 hasConceptScore W4313639219C86803240 @default.
• W4313639219 hasConceptScore W4313639219C90509273 @default.
• W4313639219 hasConceptScore W4313639219C94375191 @default.
• W4313639219 hasFunder F4320335353 @default.
• W4313639219 hasFunder F4320337345 @default.
• W4313639219 hasIssue "3" @default.
• W4313639219 hasLocation W43136392191 @default.
• W4313639219 hasLocation W43136392192 @default.
• W4313639219 hasOpenAccess W4313639219 @default.
• W4313639219 hasPrimaryLocation W43136392191 @default.
• W4313639219 hasRelatedWork W2382791850 @default.
• W4313639219 hasRelatedWork W2461499990 @default.
• W4313639219 hasRelatedWork W2883906040 @default.

• next