Smith et al., 2007 - Google Patents

Target assignment for robotic networks: Asymptotic performance under limited communication

Smith et al., 2007

View PDF
Document ID
12993083389603438378
Author
Smith S
Bullo F
Publication year
Publication venue
arXiv preprint cs/0703067

External Links

Snippet

We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of the position of every target. We address the problem of designing a distributed algorithm that …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"

Similar Documents

Publication Publication Date Title
Smith et al. Target assignment for robotic networks: Asymptotic performance under limited communication
Narasimha et al. An ant colony optimization technique for solving min–max multi-depot vehicle routing problem
Sathyaraj et al. Multiple UAVs path planning algorithms: a comparative study
Muralidharan et al. Path planning for minimizing the expected cost until success
Rokbani et al. A new hybrid gravitational particle swarm optimisation-ACO with local search mechanism, PSOGSA-ACO-Ls for TSP
Tang et al. Solving multi-agent target assignment and path finding with a single constraint tree
Macharet et al. Efficient target visiting path planning for multiple vehicles with bounded curvature
Salehisadaghiani et al. Nash equilibrium seeking with non-doubly stochastic communication weight matrix
Zhang et al. A minimum resource neural network framework for solving multiconstraint shortest path problems
Fiuk et al. A queueing model and performance analysis of UPnP/HTTP client server interactions in networked control systems
Bullo Target assignment for robotic networks: asymptotic performance under limited communication
Mantha et al. Task allocation and route planning for robotic service networks with multiple depots in indoor environments
CN111652552A (en) A method, system and device for logistics order transportation planning
Smith et al. Target assignment for robotic networks: Worst-case and stochastic performance in dense environments
Polimeni et al. Dynamic vehicle routing in road evacuation: a model for route design
Singh et al. A hybrid heuristic algorithm for the Euclidean traveling salesman problem
CN116981006A (en) Service transmission methods, devices and network equipment
Moore et al. Distributed balancing of AAVs for uniform surveillance coverage
Hong et al. A multi-robot cooperative patrolling algorithm with sharing multiple cycles
Yi et al. An improved ant colony optimisation and its application on multicast routing problem
Narasimha et al. Ant colony optimization technique to solve the min-max single depot vehicle routing problem
Cai et al. ASA-routing: A-Star adaptive routing algorithm for network-on-chips
Weber et al. Distributed Online Rollout for Multivehicle Routing in Unmapped Environments
Bajaj et al. A review on optimization with ant colony algorithm
Smith et al. A geometric assignment problem for robotic networks