FRINK Linked Data Fragments server

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

• W1963517913 endingPage "181" @default.
• W1963517913 startingPage "156" @default.
• W1963517913 abstract "Complexity theory has used a game-theoretic notion, namely alternation, to great advantage in modeling parallelism and in obtaining lower bounds. The usual definition of alternation requires that transitions be made in discrete steps. The study of differential games is a classic area of optimal control, where there is continuous interaction and alternation between the players. Differential games capture many aspects of control theory and optimal control over continuous domains. In this paper, we define a generalization of the notion of alternation which applies to differential games, and which we call “continuous alternation.” This approach allows us to obtain the first known complexity-theoretic results for open problems in differential games and optimal control. We concentrate our investigation on an important class of differential games, which we call polyhedral pursuit games. Pursuit games have application to many fundamental problems in autonomous robot control in the presence of an adversary. For example, this problem occurs in manufacturing environments with a single robot moving among a number of autonomous robots with unknown control programs, as well as in automatic automobile control, and collision control among aircraft and boats with unknown or adversary control. We show that in a three-dimensional pursuit game where each player's velocity is bounded (but there is no bound on acceleration), the pursuit game decision problem is hard for exponential time. This lower bound is somewhat surprising due to the sparse nature of the problem: there are only two moving objects (the players), each with only three degrees of freedom. It is also the first provably intractable result for any robotic problem with complete information; previous intractability results have relied on complexity-theoretic assumptions. Fortunately, we can counter our somewhat pessimistic lower bounds with polynomial time upper bounds for obtaining approximate solutions. In particular, we give polynomial time algorithms that approximately solve a very large class of pursuit games with arbitrarily small error. Forε>0, this algorithm finds a winning strategy for the evader provided that there is a winning strategy that always stays at leastε distance from the pursuer and all obstacles. If the obstacles are described withn bits, then the algorithm runs in time (n/ε) o(1), and applies to several types of pursuit games: either velocity or both acceleration and velocity may be bounded, and the bound may be of either theL 2- orL ∞-norm. Our algorithms also generalize to when the obstacles have constant degree algebraic descriptions, and are allowed to have predictable movement." @default.
• W1963517913 created "2016-06-24" @default.
• W1963517913 creator A5007364145 @default.
• W1963517913 creator A5026222278 @default.
• W1963517913 date "1993-10-01" @default.
• W1963517913 modified "2023-09-25" @default.
• W1963517913 title "Continuous alternation: The complexity of pursuit in continuous domains" @default.
• W1963517913 cites W1988180281 @default.
• W1963517913 cites W2001804342 @default.
• W1963517913 cites W2009056209 @default.
• W1963517913 cites W2016986489 @default.
• W1963517913 cites W2024693023 @default.
• W1963517913 cites W2036114412 @default.
• W1963517913 cites W2042106485 @default.
• W1963517913 cites W2067754486 @default.
• W1963517913 cites W2090544108 @default.
• W1963517913 cites W2090959114 @default.
• W1963517913 cites W2092562499 @default.
• W1963517913 cites W2111734814 @default.
• W1963517913 cites W2131988161 @default.
• W1963517913 cites W2142578141 @default.
• W1963517913 cites W2156708479 @default.
• W1963517913 cites W2158647255 @default.
• W1963517913 cites W2163178194 @default.
• W1963517913 cites W2170220350 @default.
• W1963517913 cites W2312064194 @default.
• W1963517913 cites W4229917934 @default.
• W1963517913 cites W4241108585 @default.
• W1963517913 doi "https://doi.org/10.1007/bf01891838" @default.
• W1963517913 hasPublicationYear "1993" @default.
• W1963517913 type Work @default.
• W1963517913 sameAs 1963517913 @default.
• W1963517913 citedByCount "9" @default.
• W1963517913 countsByYear W19635179132020 @default.
• W1963517913 crossrefType "journal-article" @default.
• W1963517913 hasAuthorship W1963517913A5007364145 @default.
• W1963517913 hasAuthorship W1963517913A5026222278 @default.
• W1963517913 hasBestOaLocation W19635179132 @default.
• W1963517913 hasConcept C11413529 @default.
• W1963517913 hasConcept C126255220 @default.
• W1963517913 hasConcept C127413603 @default.
• W1963517913 hasConcept C134306372 @default.
• W1963517913 hasConcept C138885662 @default.
• W1963517913 hasConcept C146978453 @default.
• W1963517913 hasConcept C24858836 @default.
• W1963517913 hasConcept C26826806 @default.
• W1963517913 hasConcept C2779006483 @default.
• W1963517913 hasConcept C311688 @default.
• W1963517913 hasConcept C33923547 @default.
• W1963517913 hasConcept C34388435 @default.
• W1963517913 hasConcept C39637292 @default.
• W1963517913 hasConcept C41008148 @default.
• W1963517913 hasConcept C41895202 @default.
• W1963517913 hasConcept C77553402 @default.
• W1963517913 hasConcept C80444323 @default.
• W1963517913 hasConcept C91575142 @default.
• W1963517913 hasConcept C93226319 @default.
• W1963517913 hasConceptScore W1963517913C11413529 @default.
• W1963517913 hasConceptScore W1963517913C126255220 @default.
• W1963517913 hasConceptScore W1963517913C127413603 @default.
• W1963517913 hasConceptScore W1963517913C134306372 @default.
• W1963517913 hasConceptScore W1963517913C138885662 @default.
• W1963517913 hasConceptScore W1963517913C146978453 @default.
• W1963517913 hasConceptScore W1963517913C24858836 @default.
• W1963517913 hasConceptScore W1963517913C26826806 @default.
• W1963517913 hasConceptScore W1963517913C2779006483 @default.
• W1963517913 hasConceptScore W1963517913C311688 @default.
• W1963517913 hasConceptScore W1963517913C33923547 @default.
• W1963517913 hasConceptScore W1963517913C34388435 @default.
• W1963517913 hasConceptScore W1963517913C39637292 @default.
• W1963517913 hasConceptScore W1963517913C41008148 @default.
• W1963517913 hasConceptScore W1963517913C41895202 @default.
• W1963517913 hasConceptScore W1963517913C77553402 @default.
• W1963517913 hasConceptScore W1963517913C80444323 @default.
• W1963517913 hasConceptScore W1963517913C91575142 @default.
• W1963517913 hasConceptScore W1963517913C93226319 @default.
• W1963517913 hasIssue "2-4" @default.
• W1963517913 hasLocation W19635179131 @default.
• W1963517913 hasLocation W19635179132 @default.
• W1963517913 hasOpenAccess W1963517913 @default.
• W1963517913 hasPrimaryLocation W19635179131 @default.
• W1963517913 hasRelatedWork W1979353002 @default.
• W1963517913 hasRelatedWork W1990818638 @default.
• W1963517913 hasRelatedWork W2043066860 @default.
• W1963517913 hasRelatedWork W2068776588 @default.
• W1963517913 hasRelatedWork W2073255355 @default.
• W1963517913 hasRelatedWork W2126291394 @default.
• W1963517913 hasRelatedWork W299296709 @default.
• W1963517913 hasRelatedWork W2999063670 @default.
• W1963517913 hasRelatedWork W4319323515 @default.
• W1963517913 hasRelatedWork W2086025566 @default.
• W1963517913 hasVolume "10" @default.
• W1963517913 isParatext "false" @default.
• W1963517913 isRetracted "false" @default.
• W1963517913 magId "1963517913" @default.
• W1963517913 workType "article" @default.