Possibilities of implementation of friendly units´ maneuver in the Common Operational Picture

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG42__%2F19%3A00555500" target="_blank" >RIV/60162694:G42__/19:00555500 - isvavai.cz</a>

Result on the web

<a href="http://sm.aos.sk/images/dokumenty/archiv_cisel/2_2019/Article3.pdf" target="_blank" >http://sm.aos.sk/images/dokumenty/archiv_cisel/2_2019/Article3.pdf</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Possibilities of implementation of friendly units´ maneuver in the Common Operational Picture

Original language description

The article describes the possibilities of the use of information sharing on the network of computer workstations when planning the maneuver routes of a group of cooperating units with the task to attack the same target in a military operation. The key factor for gaining operational superiority over the enemy in this situation is a rapid and accurate processing of all relevant information about the overall battlefield situation. The appropriate solution to this problem is the use of the MCS CZ software, which calculates the optimal maneuver route of the unit based on intelligence information. In the test case, three maneuver routes of the first-line companies of the battalion have been calculated using the MCS CZ; the aim of the battalion is to attack the enemy defending himself in a small town. In the battalion zone of attack, the system has calculated three spatially different maneuver routes of companies, along which the companies will arrive at the objective at intervals of 20 minutes and 34 seconds, and 23 minutes and 17 seconds, at a distance from 3,784 to 4,233 meters. The knowledge of these spatial and time characteristics in the planning phase of the attack allows the superior commander to coordinate a units' maneuver with neighbors in a military operation and to plan the use of forces and equipment of the combat support. The result of the calculations through the MCS CZ is the fastest route of the maneuver to reach the objective and to perform the coordinated attack of all three companies of the battalion.

Czech name

—

Czech description

—

Type

J_ost - Miscellaneous article in a specialist periodical

CEP classification

—

OECD FORD branch

10200 - Computer and information sciences

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Science & Military Journal

ISSN

1336-8885

e-ISSN

2453-7632

Volume of the periodical

2

Issue of the periodical within the volume

podzim 2019

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

6

Pages from-to

18-23

UT code for WoS article

—

EID of the result in the Scopus database

—