skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Cushioned extended-periphery avoidance: A reactive obstacle avoidance plugin
Award ID(s):
1650547
PAR ID:
10137358
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
2016 International Conference on Unmanned Aircraft Systems (ICUAS)
Page Range / eLocation ID:
399 to 405
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
  2. Abstract A coupling of random walkers on the same finite graph, who take turns sequentially, is said to be anavoidance couplingif the walkers never collide. Previous studies of these processes have focused almost exclusively on complete graphs, in particular how many walkers an avoidance coupling can include. For other graphs, apart from special cases, it has been unsettled whether even two noncolliding simple random walkers can be coupled. In this article, we construct such a coupling on (i) anyd‐regular graph avoiding a fixed subgraph depending ond; and (ii) any square‐free graph with minimum degree at least three. A corollary of the first result is that a uniformly random regular graph onnvertices admits an avoidance coupling with high probability. 
    more » « less
  3. We initiate a systematic study of key-avoidance on alternating sign matrices (ASMs) defined via pattern-avoidance on an associated permutation called the \emph{key} of an ASM. We enumerate alternating sign matrices whose key avoids a given set of permutation patterns in several instances. We show that ASMs whose key avoids $231$ are permutations, thus any known enumeration for a set of permutation patterns including $231$ extends to ASMs. We furthermore enumerate by the Catalan numbers ASMs whose key avoids both $312$ and $321$. We also show ASMs whose key avoids $312$ are in bijection with the gapless monotone triangles of [Ayyer, Cori, Gouyou-Beauchamps 2011]. Thus key-avoidance generalizes the notion of $312$-avoidance studied there. Finally, we enumerate ASMs with a given key avoiding $312$ and $321$ using a connection to Schubert polynomials, thereby deriving an interesting Catalan identity. Comment: 28 pages 
    more » « less