Nothing Special   »   [go: up one dir, main page]

Di Luna et al., 2020 - Google Patents

Meeting in a polygon by anonymous oblivious robots

Di Luna et al., 2020

View PDF
Document ID
5684034131719959232
Author
Di Luna G
Flocchini P
Santoro N
Viglietta G
Yamashita M
Publication year
Publication venue
Distributed Computing

External Links

Snippet

The Meeting problem for k ≥ 2 k≥ 2 searchers in a polygon P (possibly with holes) consists in making the searchers move within P, according to a distributed algorithm, in such a way that at least two of them eventually come to see each other, regardless of their initial …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/70—Chemoinformatics, i.e. data processing methods or systems for the retrieval, analysis, visualisation, or storage of physicochemical or structural data of chemical compounds
    • G06F19/708—Chemoinformatics, i.e. data processing methods or systems for the retrieval, analysis, visualisation, or storage of physicochemical or structural data of chemical compounds for data visualisation, e.g. molecular structure representations, graphics generation, display of maps or networks or other visual representations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models

Similar Documents

Publication Publication Date Title
Fraigniaud et al. Graph exploration by a finite automaton
Chew et al. Geometric pattern matching under Euclidean motion
Clarkson et al. Four results on randomized incremental constructions
Di Luna et al. Meeting in a polygon by anonymous oblivious robots
Kuo et al. A Delaunay-based region-growing approach to surface reconstruction from unorganized points
Bampas et al. Almost optimal asynchronous rendezvous in infinite multidimensional grids
Fleischer et al. Optimal robot localization in trees
Rao Robot navigation in unknown generalized polygonal terrains using vision sensors
Vleugels et al. Approximating generalized Voronoi diagrams in any dimension
Chen et al. Computing shortest paths among curved obstacles in the plane
Bishop Nonobtuse triangulations of PSLGs
Vleugels et al. Approximating Voronoi diagrams of convex sites in any dimension
Garban et al. Liouville dynamical percolation
Sugihara Three-dimensional convex hull as a fruitful source of diagrams
Gärtner et al. Computational geometry lecture notes hs 2013
Czyzowicz et al. Asynchronous deterministic rendezvous in bounded terrains
Czyzowicz et al. Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
Lee et al. Continuous penetration depth computation for rigid models using dynamic Minkowski sums
Du et al. Robust computation of implicit surface networks for piecewise linear functions
Steinbach et al. Efficient collision and self-collision detection for humanoids based on sphere trees hierarchies
Bose et al. Positional encoding by robots with non-rigid movements
Borowiecki et al. Distributed graph searching with a sense of direction
Simov et al. A complete pursuit-evasion algorithm for two pursuers using beam detection
Chalopin et al. Simple agents learn to find their way: an introduction on mapping polygons
Wein The integration of exact arrangements with effective motion planning