On finding the complexity of an environment for the operation of a mobile object on a plane

DOI10.1134/S0005117919050084MaRDI QIDQ2320282zbMATH OpenOpenAlexWikidataFDO

Authors V. Kh. Pshikhopov, A. N. Karkishchenko

Publication date 22 August 2019

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117919050084

zbMATH Keywords

integral complexitylocal complexitymoving objectscenetriangulation

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45)

Recommendations

• Estimating scene complexity by one and two local observations
• Competitive complexity of mobile robot on-line motion planning problems
• Complexity of nonholonomic motion planning
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
• scientific article; zbMATH DE number 1419896

Cites work

• Fast Delaunay triangulation in three dimensions
• scientific article; zbMATH DE number 14854 (Why is no real title available?)
• scientific article; zbMATH DE number 42303 (Why is no real title available?)
• Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology

Cited in

(2)

• Estimating scene complexity by one and two local observations
• scientific article; zbMATH DE number 2069492 (Why is no real title available?)

This page was built for publication: On finding the complexity of an environment for the operation of a mobile object on a plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2320282)