Approximation a reachability area in the state space for a discrete task

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

To solve the problem estimating and analyzing the quality indicators an control automated system for moving objects, it is proposed to apply an original approach based on the use reachability areas to evaluate the quality indicators of control systems for similar objects and use reachability areas formed in the space of significant system-technical indicators as an information basis. Because the analytical solution such problems even on modern computers requires significant (large) computational resources, it is proposed to use analytical geometry (and, in particular, projective geometry) to solve them. Thus, in order to build reachability area, as well as construction the target set at reachability area, the article discusses the use JavaScript with the Ganja.js package. The article will give specific recommendations for solving the investigated problem.

Cite

CITATION STYLE

APA

Ushakov, V. (2020). Approximation a reachability area in the state space for a discrete task. In Advances in Intelligent Systems and Computing (Vol. 1226 AISC, pp. 617–624). Springer. https://doi.org/10.1007/978-3-030-51974-2_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free