Probabilistic properties of near-optimal trajectories of an agent moving over a lattice

DOI10.1007/s10957-018-1374-6zbMath1421.49018OpenAlexW2888285315WikidataQ129399755 ScholiaQ129399755MaRDI QIDQ2317851

Yanyan Li

Publication date: 13 August 2019

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-018-1374-6

zbMATH Keywords

latticeBrownian bridgeagentspathfindingextreme values distributionRician distribution

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Existence of optimal solutions to problems involving randomness (49J55)

Related Items (1)

Continuous optimisation problem and game theory for multi-agent pathfinding

Cites Work

• Unnamed Item
• Unnamed Item
• Experimental reaction-diffusion chemical processors for robot path planning
• Modeling transport through an environment crowded by a mixture of obstacles of different shapes and sizes
• A simplified combat model based on a cellular automaton
• On the motion of agents across terrain with obstacles
• Voronoi-like partition of lattice in cellular automata
• A model of the joint motion of agents with a three-level hierarchy based on a cellular automaton
• Towards Context-Based Concurrent Formal Theories

This page was built for publication: Probabilistic properties of near-optimal trajectories of an agent moving over a lattice