| Literature DB >> 33868506 |
Yaoyao Liu1, Yixin Zhang1,2, Xiaoya Liu3.
Abstract
Through the COVID-19 epidemic in 2020, the society has deeply realized the inevitability and necessity of building a community that shares the future of mankind. In the face of severely complex international trends and domestic and international economic conditions, artificial intelligence plays an important auxiliary role in the regular prevention and management of COVID-19. In order to effectively correspond to the formalized extensional prevention and control theory, it is essential to use coordination models, rule systems, prevention and control mechanisms, and governance landscapes to build artificial intelligence corresponding systems. This article uses a basic genetic algorithm to realize the robot path plan. This mainly includes the establishment of environmental models, the discovery of chromosomes and the determination of coding methods, the selection and design of fitness functions, and related designs. This paper proposes a new adaptive adjustment mode based on the basic genetic algorithm, which improves the selection and mutation operation, and improves the optimization efficiency of the genetic algorithm. Building an artificial intelligence response system may face various technical risks and governance dilemmas. Only by improving the rule system of artificial intelligence, creating an epidemic prevention and control ecology, conserving the public spirit of the whole people, strengthening the governance of the source of crisis, and further improving the new momentum of economic and social development and public safety. The modernization of governance capabilities can better respond to the current complex situation.Entities:
Keywords: Artificial intelligence development; Covid19; Embedded computer; Improved genetic algorithm
Year: 2021 PMID: 33868506 PMCID: PMC8034767 DOI: 10.1007/s12652-021-03218-5
Source DB: PubMed Journal: J Ambient Intell Humaniz Comput
Performance comparison between general floating point coding GA and improved GA
| Function | Threshold | Blocks | Average cutoff algebra | Maximum genetic algebra | |
|---|---|---|---|---|---|
| Floating point encoding GA | F6 | 0.999 | 12 | 70.6 | 100 |
| Sort GA | 0 | 6.2 | 20 |
Fig. 1Environment model represented by grid method
Fig. 2Correspondence between grid coordinates and serial numbers
Fig. 3Route diagram
Fig. 4Discontinuous white by grid path diagram
Fig. 5Schematic diagram of random variation operation
Fig. 6The schematic diagram of mutation operation proposed in this paper
Fig. 7Flow chart of improved genetic algorithm
Fig. 8Multiflex2-pxa270 controller
Fig. 9Population evolution curve of basic genetic algorithm
Fig. 10Population evolution curve of improved genetic algorithm
15 simulation results of Map 1 improved genetic algorithm
| Number of runs | Evolutionary algebra | Path length | Number of grids passed | Solving time (ms) |
|---|---|---|---|---|
| 1 | 42 | 11.7727 | 5 | 768 |
| 2 | 36 | 11.7727 | 5 | 773 |
| 3 | 53 | 11.7727 | 5 | 802 |
| 4 | 47 | 11.9016 | 5 | 756 |
| 5 | 44 | 11.7727 | 5 | 739 |
| 6 | 42 | 11.7727 | 5 | 726 |
| 7 | 51 | 11.7727 | 5 | 836 |
| 8 | 45 | 11.7727 | 5 | 821 |
| 9 | 39 | 11.7727 | 5 | 769 |
| 10 | 41 | 11.7727 | 5 | 746 |
| 11 | 49 | 11.8651 | 5 | 805 |
| 12 | 46 | 11.7727 | 5 | 775 |
| 13 | 53 | 11.7727 | 5 | 761 |
| 14 | 46 | 11.7727 | 5 | 816 |
| 15 | 45 | 11.7727 | 5 | 732 |
| Average length | 11.7850 | Average solving time (ms) | 775 |
15 simulation results of Map 1 basic genetic algorithm
| Number of runs | Evolutionary algebra | Path length | Number of grids passed | Solving time (ms) |
|---|---|---|---|---|
| 1 | 86 | 12.4196 | 11 | 2685 |
| 2 | 93 | 12.5728 | 12 | 2873 |
| 3 | 87 | 12.4196 | 11 | 1980 |
| 4 | 96 | 12.4196 | 11 | 2386 |
| 5 | 79 | 12.4196 | 11 | 2794 |
| 6 | 88 | 12.5728 | 12 | 2286 |
| 7 | 99 | 12.4196 | 11 | 1680 |
| 8 | 91 | 12.9918 | 13 | 2969 |
| 9 | 85 | 12.4196 | 11 | 2651 |
| 10 | 80 | 12.5728 | 12 | 2565 |
| 11 | 76 | 12.4196 | 11 | 2731 |
| 12 | 97 | 12.4196 | 11 | 2856 |
| 13 | 92 | 12.9918 | 13 | 3218 |
| 14 | 83 | 12.4196 | 11 | 2693 |
| 15 | 87 | 12.4196 | 11 | 2901 |
| Average length | 12.5265 | Average solving time (ms) | 2618 |
Fig. 11Path planning of basic genetic algorithm
Fig. 12The genetic algorithm path planning diagram in this paper