52 results about "Connectivity graph" patented technology

The invention discloses a quantum circuit conversion method and system, electronic equipment and a storage medium, and relates to the technical field of quantum circuit conversion, and the method comprises the steps: extracting a feature vector of a logic quantum circuit based on initial quantum bit mapping; the feature vector is input into a pre-trained decision tree, recommendation parameters of a line conversion algorithm are obtained, the decision tree is constructed by a training set, and the feature vector of each sample corresponds to the optimal parameter of the decision tree, namely the parameter with the minimum number of physical line gates; and configuring a line conversion algorithm by using recommended parameters, converting a logic line into a physical line, and ensuring that all two quantum bit gates meet quantum computer connected graph constraints and are equivalent in function. According to the method, adaptive parameter configuration can be achieved through the feature vectors and the decision tree, the line conversion quality is effectively improved, the number of physical line gates is remarkably reduced, and the quantum program execution efficiency is improved on the premise that function equivalence and connectivity are guaranteed.

The invention discloses a topological communication coverage path planning method and system of an unmanned ship cluster for wide-area target search and detection, and belongs to the technical field of multi-agent collaborative path planning. According to the method, turning frequency optimization is converted into a minimum rectangular coverage problem, an integer programming model is established, a layered relaxation integer programming acceleration strategy based on maximum extension candidates is proposed, and the bottleneck of model expansion and calculation efficiency caused by candidate solution space explosion in a large-scale scene is broken through; then, constructing a rectangular topological connected graph, designing an improved spectral clustering algorithm fusing load balancing constraint and subgraph connectivity guarantee, realizing efficient and balanced distribution of regions in a complex environment, and ensuring internal connectivity of subregions; and finally, providing a dynamic pruning optimization method for the minimum corner spanning tree based on strong and weak connection characteristics, iteratively evaluating the corner cost and removing redundant edges, and finally generating a coverage path spanning tree with the minimum corner cost, thereby providing an accurate and efficient full-coverage operation path for scenes such as regional exploration and environment monitoring.

The invention provides an oil reservoir inter-well communication path dynamic evolution intelligent prediction method and system based on permeability change, and relates to the technical field of intelligent oil and gas field development. The method comprises the following steps: preprocessing static seismic multi-attribute, initial permeability and production dynamic data, and extracting multi-scale features; establishing a dynamic permeability and static prior fusion mechanism, and generating a dynamic weight connectivity graph; on the basis, reinforcement learning path search is adopted, dynamic re-planning is achieved through time sequence rolling, and inter-well communication paths and migration rules are obtained; a non-dominated solution set and a Pareto frontier are formed in combination with multi-objective optimization of path length and cumulative flow capacity, and candidate schemes are provided for different engineering preferences; and finally outputting a spatio-temporal evolution prediction result of the path and a matched adjustment suggestion. The method realizes the fusion of static and dynamic data, breaks through the limitation of depicting the reservoir only by depending on static earthquakes, and remarkably improves the development effect and decision scientificity of the marine facies sandstone reservoir.

According to one aspect, the subject matter of the present description is a method for allocating logical qubits of a quantum algorithm to physical qubits of a quantum processor arranged according to a given architecture, the method including: establishing, from the architecture, a connectivity graph; the establishing, from the quantum algorithm, a graph of the logical operations; assigning a weight to each logical qubit; ranking the logical qubits according to the weight; allocating a first logical qubit chosen according to the weight, to a first physical qubit of the quantum register; iteratively allocating the logical qubits remaining to be allocated, including calculating a score; and reproducing the iterative allocation procedure until allocating the last logical qubit remaining to be allocated, thus resulting in obtaining a configuration for allocating logical qubits of the quantum algorithm to physical qubits of the quantum processor.

A vector retrieval method is proposed to improve the efficiency of vector retrieval. In this method, when performing vector retrieval based on a vector connectivity graph, the distance between the second-order quantized data of a vector and the query vector is calculated to determine whether the vector needs to be added to the candidate set. After the candidate set is updated, the distance between the vectors in the candidate set and the query vector is updated to the distance between the vector's first-order quantized data and the query vector. Since both the first-order and second-order quantized data are obtained by quantizing the original vector data, using the second-order quantized data to calculate the distance between vectors during vector traversal of the vector connectivity graph effectively improves computational efficiency. Furthermore, using the first-order quantized data to update the distance between vectors after the candidate set is updated ensures that the vector with the largest distance to the query vector in the candidate set is replaced each time the candidate set is updated, thereby guaranteeing the accuracy of vector retrieval.

This invention discloses an ecological management zoning method and system based on static and dynamic supply and demand matching, belonging to the field of ecological management technology. The invention constructs a node feature matrix by calculating a comprehensive static supply and demand matching index and a comprehensive dynamic change trend index, then generates a dynamic spatiotemporal adjacency matrix to construct a spatiotemporal physical connectivity graph. This graph is then input into a spatiotemporal graph neural network for processing, outputting predicted static supply and demand matching indices and predicted dynamic change trend indices. Based on the zero-value boundaries of these indices, the study area is divided into initial four-level basic management zones. A Markov decision process is then constructed, and a Pareto optimal solution set is obtained through reinforcement learning algorithms to fine-tune the spatial boundaries of the initial four-level basic management zones. The resulting refined ecological management zoning map and management priority sequence are output, making the zoning results more targeted for management. This solves the problem that existing ecological management zoning results lag behind actual changes and are difficult to effectively support adaptive management.

This invention relates to the field of 3D model processing technology, specifically to an intelligent hierarchical simplification method and device for 3D models. The method involves acquiring 3D device model data and converting it into a mesh model; performing region growth and segmentation based on patch normals and curvature to obtain the original component regions; employing standard part matching, rule base matching, and deep learning recognition for three-level semantic annotation and importance grading; generating multi-precision mesh models based on the importance level using a feature-weighted point cloud non-uniform simplification algorithm; and finally assembling 3D device model data with different simplification precipitates based on the region connectivity graph. This application achieves intelligent and differentiated hierarchical simplification of 3D models, balancing core feature preservation with data lightweighting, adapting to the needs of multiple application scenarios, and improving the efficiency and flexibility of model processing.

The invention provides an AIS intra-cluster local path self-adaptive reconstruction method and system, and the method comprises the steps: generating a global route based on an off-line constructed maritime traffic network connected graph plan according to a starting and ending point and an expected navigational speed inputted by a user, and carrying out the local path reconstruction of a cluster where a route turning point is located, global course information of the global course is obtained; according to the global course information and the expected navigational speed, obtaining an optimal sub-cluster in the cluster where the course turning point is located; and obtaining a cluster entrance reference point and a cluster exit reference point in the optimal sub-cluster through an adaptive algorithm, reconstructing a local path in the cluster according to the cluster entrance reference point and the cluster exit reference point, and updating global course information of the global course. According to the method, the global course information is utilized and the AIS track points in the clusters are combined to guide the adaptive reconstruction of the local paths in the clusters, so that the centroids of the clusters are not directly connected any more, the route planning is more consistent with the logic, and the authenticity and availability of the route planning are improved.

This invention discloses an image clustering method, apparatus, computer device, and storage medium. The method involves acquiring a sample image cluster, which includes multiple sample image nodes. After performing image clustering on each sample image node to obtain an image connectivity graph, the image connectivity graph is segmented to obtain at least one image connectivity subgraph. Each image connectivity subgraph includes at least one node relationship edge connecting two sample image nodes. The shortest path value and the robustness value of the relationship edges corresponding to all node relationship edges in each image connectivity subgraph are determined. Based on the shortest path value and the robustness value of the relationship edges corresponding to each node relationship edge, a target connectivity graph corresponding to the sample image cluster is determined from the image connectivity graph. This invention improves the accuracy and precision of image clustering and segmentation.

Systems and methods are provided for automatically grouping branch devices based on device information (e.g., IPSec tunnel connectivity, etc.). The devices with similar branch gateways which would customarily receive similar route information and / or properties (e.g., AS-PATH, cost, MED, Metric1, Metric2, community / extended community) and / or devices with similar connectivity graphs can be grouped together. This can reduce the number of electronic communications transmitted throughout the network and increase computational efficiency for the controller and devices.

The application relates to a text recognition method and device, computer equipment and a readable storage medium. The method comprises the following steps: obtaining to-be-detected text and association relationship information; generating a text connectivity graph according to the to-be-detected text and the association relationship information; iteratively updating the text connectivity graph, and generating target text features corresponding to the to-be-detected text according to the iteratively updated text connectivity graph; and identifying target text with semantic repetition from the to-be-detected text by clustering the target text features of the to-be-detected text. The method can accurately recognize text.

This application concerns a computer-implemented method for compiling an input unitary acting on a set of logical qubits to an output quantum circuit operable on a quantum system comprising a plurality of output qubits (1), wherein the output qubits (1) of the quantum system are arranged in accordance with a connectivity mesh (11), wherein nodes (111) of the connectivity mesh (11) represent possible sites for the output qubits (1) of the quantum system and each edge (112) of the connectivity mesh (11) indicates that quantum interactions between the output qubits (1) of the quantum system connected by one of the edges (112) are possible, comprising the following steps: providing the connectivity mesh (11) of the quantum system; assigning an index to each of the logical qubits; extracting a set of target labels (2) from the input unitary, wherein the target labels (2) correspond to a set comprising at least one of the indices of the logical qubits; compiling circuit building blocks (4) implementing a subset of the target labels (2), wherein the circuit building blocks (4) comprise body path gates (41) and / or leg gates (42) acting on the output qubits (1), wherein compiling the circuit building blocks (4) comprises: defining a tree (3) comprising a subset of edges (112) and a subset of nodes (111) of the connectivity mesh (11), wherein the tree (3) comprises a body (31) with at least one body node (1111) representing a site for an output qubit (1), wherein the body (31) comprises at least two output qubits (1) at two body nodes (1111) and at least one path (6) connecting all body nodes (1111) of the body (31) and / or at least one leg (32) with at least one leg node (1112) representing a site for an output qubit (1), wherein the at least one leg node (1112) is connected by an edge (112) with at least one body node (1111); adding a body path gate (41) to the output quantum circuit for each body node (1111) along the at least one path (6) and / or adding a leg path gate (42) to the output quantum circuit for each leg node (1112); adding a single-qubit gate (43) to the output quantum circuit for at least one of the target labels (2) of the input unitary, wherein the single-qubit gate acts on the output qubit (1) and at the moment on which the target label (2) is implemented due to the gates of the circuit building blocks (4).

A subsurface representation may define subsurface configuration of a subsurface region. A grid connectivity graph for the subsurface representation may include (1) nodes that represent cells within the subsurface representation, and (2) edges between the nodes that represent connectivity between the cells within the subsurface representation. The grid connectivity graph may be filtered to remove edges that do not satisfy a connectivity criterion. The filtered grid connectivity graph may be used to compute a linear solver preconditioner that improves the performance of the subsurface simulation.

The invention provides a quantum error correction decoding method and decoder based on hypergraph contraction, and belongs to the technical field of quantum error correction decoding. The quantum error correction decoding method comprises the following steps: S1, constructing a comprehensive measurement circuit containing noise, and generating a detector error model and a measurement sample set by using the comprehensive measurement circuit; s2, converting the detector error model into a hypergraph structure; s3, selecting hyperedges closely related to the currently input measurement sample in the hypergraph structure to construct a sub-hypergraph structure; s4, simplifying the sub-hypergraph structure into a connectivity graph, and determining a contraction sequence of the sub-hypergraph based on the connectivity graph; s5, performing approximate contraction processing on the sub-hypergraph according to the determined contraction sequence to obtain approximate distribution of error mechanism probability; and S6, determining a final decoding output result according to the approximate distribution of the error mechanism probability.

This application concerns a computer-implemented method for compiling an input unitary acting on a set of logical qubits to an output quantum circuit operable on a quantum system comprising a plurality of output qubits (1), wherein the output qubits (1) of the quantum system are arranged in accordance with a connectivity mesh (11), wherein nodes (111) of the connectivity mesh (11) represent possible sites for the output qubits (1) of the quantum system and each edge (112) of the connectivity mesh (11) indicates that quantum interactions between the output qubits (1) of the quantum system connected by one of the edges (112) are possible, comprising the following steps: providing the connectivity mesh (11) of the quantum system; assigning an index to each of the logical qubits; extracting a set of target labels (2) from the input unitary, wherein the target labels (2) correspond to a set comprising at least one of the indices of the logical qubits; compiling circuit building blocks (4) implementing a subset of the target labels (2), wherein the circuit building blocks (4) comprise body path gates (41) and / or leg gates (42) acting on the output qubits (1), wherein compiling the circuit building blocks (4) comprises: defining a tree (3) comprising a subset of edges (112) and a subset of nodes (111) of the connectivity mesh (11), wherein the tree (3) comprises a body (31) with at least one body node (1111) representing a site for an output qubit (1), wherein the body (31) comprises at least two output qubits (1) at two body nodes (1111) and at least one path (6) connecting all body nodes (1111) of the body (31) and / or at least one leg (32) with at least one leg node (1112) representing a site for an output qubit (1), wherein the at least one leg node (1112) is connected by an edge (112) with at least one body node (1111); adding a body path gate (41) to the output quantum circuit for each body node (1111) along the at least one path (6) and / or adding a leg path gate (42) to the output quantum circuit for each leg node (1112); adding a single-qubit gate (43) to the output quantum circuit for at least one of the target labels (2) of the input unitary, wherein the single-qubit gate acts on the output qubit (1) and at the moment on which the target label (2) is implemented due to the gates of the circuit building blocks (4).

The application provides a line optimization method, device and equipment of a quantum key distribution network and a medium, comprising: acquiring a quantum network connectivity graph of a quantum key distribution network; determining a bottleneck line set according to the quantum network connectivity graph; determining a total importance index corresponding to the bottleneck line set, the total importance index being the sum of the importance index of each bottleneck line included in the bottleneck line set; and expanding the bottleneck line in the bottleneck line set according to the total importance index, thereby solving the problem of difficult expansion of the bottleneck line of the quantum key distribution network.

The invention relates to the technical field of power grid data processing and analysis, in particular to a topology correction method for transmission, transformation and distribution equipment with topology and ledger consistency and computer equipment. According to the method, firstly, attributes and topological information of transmission, transformation and distribution equipment are extracted from a PMS system, and a logic connection graph is constructed; on the basis of the logic connection graph, topological connectivity and ledger consistency proofreading in the specialty, between transmission and transformation specialties and between transformation and distribution specialties are executed in sequence, and all non-connected equipment and ledger inconsistent items are marked; wherein the inter-specialty proofreading adopts a sequence traversal algorithm to respectively verify communication paths and ledger information from a power transmission line to a transformer substation bus and from a distribution network line to a transformer substation outgoing circuit breaker; and generating a governance work order based on a marking result, and directionally pushing the governance work order to an operation and maintenance party to complete a data correction closed loop. Based on the method, the problem that the machine account information is not matched with the topological information can be effectively solved, so that the operation and maintenance precision of the power grid is improved.

This invention discloses a method, apparatus, electronic device, and storage medium for constructing laser SLAM point cloud maps, belonging to the field of laser SLAM point cloud map construction. The method includes: acquiring a laser point cloud frame sequence, an initial pose matrix set, an initial connectivity graph, and topology correction instructions; performing fine registration on selected point cloud frames according to the topology correction instructions to obtain a refined relative pose matrix and connectivity confidence weights, setting corresponding connectivity relationships as fixed connectivity relationships and the rest as non-fixed connectivity relationships; constructing a global pose graph optimization model based on the pose nodes and fixed and non-fixed connectivity relationships and performing optimization to obtain a globally optimized pose matrix set, generating a global point cloud map. By implementing this invention, the problem of existing technologies, which use a single elastic constraint mechanism, making it difficult to maintain the correct topology structure after correction, thus failing to generate a geometrically consistent and accurate global point cloud map, can be solved.

This invention relates to a ground identification method and apparatus, mobile tools, and related products. The method includes: performing ring-direction alignment processing on a single frame of multi-ring point cloud transmitted by a multi-line lidar to generate a multi-ring aligned point cloud; for each ring aligned point cloud, forming data elements from each data point in the ring aligned point cloud and its forward, backward, and left points and storing them in a queue, and sequentially calculating the connectivity relationships of the data points in each data element; generating a connectivity graph of the ring aligned point cloud based on the connectivity relationships of the data points in each data element; determining suspected ground points from the multi-ring aligned point cloud based on the connectivity graph corresponding to the multi-ring aligned point cloud; fitting a ground equation based on the suspected ground points; and determining ground points from the multi-ring aligned point cloud based on the ground equation. This invention reduces the algorithmic complexity of ground identification in point clouds and improves computational efficiency by designing the connectivity graph of each data point in the multi-ring point cloud.

The invention discloses a yarn defect self-adaptive repairing method based on artificial intelligence, which comprises the following steps: S1, collecting multi-source yarn data, reconstructing an orientation tensor field and a torsion field, and generating a fiber connected graph; s2, detecting and positioning defects based on the connected graph, and generating a repair window; s3, reconstructing a prior image through reversible mapping modeling, and calculating a repairability score; s4, performing conditional diffusion restoration to generate a target image, and extracting restoration execution parameters; s5, performing micro-electrospinning complementary winding and plasma shaping, and feeding back, adjusting and repairing parameters; and S6, torsion consistency and fingerprint retention are calculated, and release or repair is judged. According to the method, automatic positioning and high-quality self-adaptive repairing of yarn defects are achieved through multi-source sensing modeling, defect intelligent identification and conditional diffusion repairing methods.

The invention discloses a motor sweeper operation path generation method and device, and the method comprises the steps: constructing a road connected graph based on a to-be-swept region map road boundary and a topological connection relation; coarsening the connected graph according to a preset merging strategy, and merging the fine-grained nodes into logic region nodes; constructing a final cleaning task area based on the coarsened connected graph; planning a sub-region cleaning sequence in combination with the current position of the cleaning vehicle; and constructing a global operation path. According to the invention, whole-process automation of cleaning area division and sequence planning is realized, manual intervention is not needed, and operation efficiency and reliability are improved; complex road topologies such as roundabout and the like are adapted, and sub-region division is more reasonable; a heuristic weight and an improved threshold acceptance algorithm are fused, the solving efficiency and the planning quality are balanced, and the requirements for the real-time performance and the accuracy of outdoor cleaning are met.

This invention discloses a method for synthesizing plant disease image data based on a lesion information transmission and diffusion model, belonging to the field of plant disease detection technology. The method first detects and segments lesion regions in the original disease image using a fine-tuned visual basic model. Second, a connectivity graph is constructed based on the spatial relationships of lesion locations, and a mask image is generated that preserves the lesions and obscures healthy tissue, along with corresponding related images around the lesions. Then, the mask image is used as input to a diffusion model, and semantic features extracted from related images are used to guide the diffusion process to generate a high-fidelity disease image. Finally, using the trained model, a novel, realistic plant disease image is synthesized in a designated area of ​​a healthy leaf image. This invention can accurately capture the lesion features of plant diseases and generate high-quality disease images, providing high-quality training data for disease diagnosis models.

This invention relates to the field of medical image processing technology, and discloses a method, system, terminal, and storage medium for constructing individual morphological connectivity maps. The method includes: preprocessing a three-dimensional T1-weighted structural magnetic resonance image of an individual to obtain a gray matter volume map in standard space; extracting multiple radiomics features from the gray matter volume map to generate multiple initial feature maps; standardizing and smoothing the multiple initial feature maps to obtain multiple target feature maps, and constructing a multidimensional feature vector for each voxel; selecting seed points and extracting their feature vectors; calculating the correlation coefficient between the multidimensional feature vector of each voxel in the whole brain and the seed point feature vector on a voxel-by-voxel basis; and generating a morphological connectivity map based on the correlation coefficient. This invention achieves high spatial resolution morphological connectivity maps at the individual level without the need for predefined brain regions, overcoming the limitations of traditional group-level and brain region-dependent methods.

Provided herein are various enhancements for establishing dynamic mesh networking across a constellation of satellites and ground stations. An example method includes obtaining a request to generate a communication network for a time interval among a constellation of satellites. The method also includes identifying one or more connectivity graphs for the constellation based on a state of the constellation during at least the time interval and applying a selected routing algorithm against the one or more connectivity graphs to generate a communication route among the constellation during the time interval. The method further includes producing a set of parameters to configure routing of the communication route among the constellation to establish the communication network for the time interval.

The invention relates to the technical field of satellite communication, and particularly discloses a satellite network routing method and system based on scheduling perception and QoS constraint, and the method comprises the steps: building a statistical model of arrival processes and service processes of services with different priorities based on random network calculation and a yoke theory; constructing a yoke process, determining end-to-end time delay violation probabilities of different priority scheduling strategies, and deducing a time delay violation probability compact upper bound of each service under the corresponding scheduling strategy based on a yoke stop time theorem; constructing a time connectivity graph model, and calculating a link effective connectivity time window; a target path with the optimal comprehensive performance is selected from the feasible paths by adopting a scheduling sensing routing optimization algorithm and taking the weighted sum of the end-to-end delay and the delay violation probability as a target function, so that a deterministic QoS guarantee can be provided in a dynamic satellite network, the network reliability is remarkably improved, and the network performance is improved. And a theoretical foundation is laid for service quality management of the 6G satellite internet.

The application discloses a crack size measurement method based on image connectivity and skeleton analysis, and specifically comprises the following steps: image preprocessing and crack segmentation are performed on an original image, the connectivity graph of each crack is detected, the area of the connectivity graph is calculated by summing up the number of all pixel points in the connectivity graph, then the skeleton of the image is extracted, the Euclidean distance transformation is performed on all pixel points in the connectivity graph, and the distance transformation value of the pixel points on the skeleton is extracted from the distance transformation matrix of the calculated connectivity graph; the skeleton, the maximum crack width and the maximum crack position information are calculated, the skeleton line is drawn on the original image, the crack number and the width value are marked, and the image file is saved after the image crack visualization marking is completed. The application has the advantages that the application can be used for crack size measurement in various scenes, has the characteristics of wide application range, strong adaptability, accurate measurement, small calculation power consumption and high operation efficiency, and the like.

A computing device may determine, based on first information identifying one or more maximal cliques in a first connectivity graph, a set of potential cliques in a second connectivity graph that is an updated version of the first connectivity graph. The computing device may determine a set of valid cliques, of the set of potential cliques, in the second connectivity graph and may determine, based on the set of valid cliques, a first set of maximal cliques in the second connectivity graph. The computing device may determine, based on a set of nodes of the second connectivity graph that are not included in the first set of maximal cliques, a second set of maximal cliques in the second connectivity graph. The computing device may determine second information identifying the first set of maximal cliques and the second set of maximal cliques.

The invention discloses a mineral product prediction method based on spatial intelligence, and relates to the technical field of spatial intelligence, and the method comprises the steps: recognizing the spatial relationship of a spatial entity element list, constructing a topological connected map, extracting the attribute of a connected structure, executing semantic relationship reasoning, and generating an object-level spatial intelligent scene graph; constructing an anisotropic cost field based on the object-level space intelligent scene graph, calculating a minimum cost channel distance, mapping the minimum cost channel distance into a channel weight expression, and generating a channel weight graph layer; and carrying out space alignment and multi-modal space correlation feature fusion on the multi-source metallogenic evidence data set, the object-level space intelligent scene graph and the channel weight layer, and executing mineral reasoning through a mineral prediction machine learning model to generate a mineral prediction layer. According to the method, the dynamic modeling of the metallogenic path is realized, and the prediction precision and the engineering practicability are improved.

This invention provides a graph-theory-based method and apparatus for determining multi-angle observation opportunities in heterogeneous SAR, comprising: calculating the intersection points of the ground trajectory centerlines of several SAR satellites; establishing an edge on the ground trajectory centerlines connected by any two intersection points based on geometric constraints; for each intersection point, determining the neighboring intersection points based on the edge, obtaining interior angles based on the intersection point and its neighboring intersection points, and determining candidate cooperative points based on the interior angles; generating a local connectivity graph based on the candidate cooperative points, performing a heuristic search on the local connectivity graph according to preset rules to obtain polygonal regions; and verifying and filtering the polygonal regions to obtain cooperative observation areas. This scheme can proactively and completely identify geometrically feasible cooperative observation opportunities from a massive number of trajectory intersection points, providing a systematic solution for the efficient utilization of global on-orbit SAR resources.

The invention discloses a student companion teaching research system based on computer simulation, and relates to modeling, simulation experiments and data analysis of student companion teaching behaviors. The system is composed of a student companion teaching behavior strategy simulation module, a social simulation module and a data collection and analysis module, can simulate various student interactive behaviors, and performs experimental analysis on the influence of emotion, experience, neighbors and other factors on the behaviors. A core experiment framework of the system is formed by five behavior selection strategies (based on emotions, win-win people and input people exchange, the highest accumulated reward, most of historical behaviors of opponents and most of neighbors) and three network structures (full connection, grids and small world networks), the complex dynamic state of student companion teaching can be efficiently simulated, and factors influencing the interactive behaviors of the students are revealed. The system adopts an agent modeling technology, and each student is regarded as an independent agent and can autonomously select behaviors and update emotional states in interaction. Experimental results show that a behavior selection strategy and a network structure have significant influence on student interaction behaviors, for example, an emotion-based strategy can better encourage companion teaching in a full-connection network, and existence of a fixed behavior agent also affects a behavior mode of a whole group. The invention provides an efficient and flexible research platform for exploring the relationship between the student companion teaching behaviors and various factors, and provides a reference basis for the school to optimize the companion teaching environment.