Student information management system

Through the student information management system, the class schedule and path planning are optimized, and the problem of unreasonable classroom distance and duration of recess in teaching management is solved, students' efficient movement and safety management are achieved, and the risks of physical fatigue and safety accidents are reduced.

CN119272936AInactive Publication Date: 2025-01-07HAIKUI NETWORK TECHNOLOGY (HAINAN) CO LTD
View PDF 0 Cites 3 Cited by

Patent Information

Application Number
CN202411383774.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-30
Publication Date
2025-01-07
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

In the existing teaching management, the distance between the classroom and the length of time between students are unreasonable, resulting in students having to quickly cross the campus within a limited time, increasing the risk of physical fatigue and safety accidents.

Method used

Design a student information management system, including a distance planning module, class schedule optimization and intelligent scheduling module and a security management notification module, automatically calculate the shortest path between students, optimize class schedule arrangement to reduce moving distance, and monitor it through cameras and computer vision technology Crowd conditions, assess the probability of accidents.

Benefits of technology

Reduce students' moving time, reduce fatigue and lateness risks, improve learning experience, improve management efficiency, and reduce the occurrence of safety accidents.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119272936A_ABST
    Figure CN119272936A_ABST
Patent Text Reader

Abstract

The invention relates to the technical field of terminal intelligent management, and particularly discloses a student information management system which is used for solving the problem that in existing teaching management, the distance between classrooms and the class duration arrangement of students are unreasonable. According to the invention, the shortest path of students among different classrooms is automatically calculated through the path planning module, so that the moving time of the students is reduced, and the students have more break time and prepare for the next course; the course schedule optimization and intelligent scheduling module dynamically adjusts course arrangement according to the walking distance and time between teaching buildings, the total moving distance of students in different courses is reduced to the maximum extent, and the students are prevented from being late or feeling tired due to running; the safety management notification module monitors the personnel flow of corridors and stairs in real time through a camera and a computer vision technology, automatically monitors the crowding condition, evaluates the accident occurrence probability, and reminds students and managers to take countermeasures, so that stampede or other safety accidents are prevented.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of student information management, and more specifically, to a student information management system. Background Art

[0002] In the current teaching management, there is an unreasonable phenomenon between the distance between classrooms and the length of students' breaks, which has become a common problem that affects students' learning efficiency and quality of life. In the existing public literature, document 1 (Wu Mei. Research on the Problems and Solutions of School Timetable Arrangement [D]. Northwest Normal University, 2018.) optimizes the problem that the existing timetable arrangement ignores students' learning and development and does not start from the standpoint of students' "learning". Document 2 (Meng Qiang. Research on the Reform of Timetable Arrangement in Higher Vocational Colleges [J]. Lucheng Journal, 2024, 36(01):121-122+128.) explains the characteristics of the curriculum system of higher vocational colleges, the timetable arrangement process and the common problems, and gives solutions. However, when students take classes on different floors or in different teaching buildings, and the interval between the end of get out of class and the next class is short, students need to quickly cross the campus within a limited time, travel between multiple classrooms, and even compete for time in crowded corridors. The problem of frequent running between teaching buildings has not been considered, especially when the floors are high or the teaching buildings are widely distributed. Students are prone to physical fatigue, which in turn affects their attention and learning effects in subsequent courses. When the time between classes is tight, students will speed up their pace or even run to catch up, resulting in congestion in stairs and corridors, increasing the risk of safety accidents, especially during peak hours and in narrow corridors. In order to solve the above problems, a technical solution is now provided. Summary of the invention

[0003] In order to overcome the above-mentioned defects of the prior art, the present invention provides a student information management system for solving the problem of unreasonable phenomenon between the distance between classrooms and the duration of students' breaks in the existing teaching management, so as to solve the problems raised in the above-mentioned background technology.

[0004] To achieve the above object, the present invention provides the following technical solutions:

[0005] A student information management system includes a processor and a route planning module, a timetable optimization and intelligent scheduling module and a safety management notification module connected to the processor in communication. The route planning module is used to build a student information management structure model according to the actual distance between the floor where the classroom is located and different teaching buildings, and automatically calculate the shortest path for students from one classroom to another classroom; the timetable optimization and intelligent scheduling module is used to optimize the timetable arrangement in combination with route planning, minimize the moving distance between two classes, take the walking distance and time between teaching buildings as parameters, and set the optimization goal to minimize the total moving distance of students between different courses within a period of time; the safety management notification module is used to automatically issue a warning when a crowded situation in the corridor or stairs between classes is detected, and evaluate the probability of an accident, and remind students and management personnel to take corresponding measures; the route planning module is used to build a student information management structure model according to the actual distance between the floor where the classroom is located and different teaching buildings, and automatically calculate the shortest path for students from one classroom to another classroom, wherein the student information management structure model is composed of a student group Fm i , Subject Area j And course category c k The first management process is the course selection process, which is based on the subject area. j , placing courses from similar fields and research areas into the jth subject area d j Inside, that is Among them, c1 is the first course category, c2 is the second course category, and each course category includes m courses, that is, c k =(v1+v2+…+v m ), where v1 is the first type of course, v2 is the second type of course, and v m For the mth course; student group Fm i Ability to choose any one of the three subject areas (d1, d2, d3) k The priorities of these three subject areas are: primary (d1→D p ), Level 2 (d2→D s ) and level 3 (d3→D t ), where D p Primary subject area, refers to the core courses in the subject area, s It is a secondary subject area, which refers to the basic courses in the subject area. t It is a third-level subject area, which refers to non-core courses and non-basic courses in the subject area, thereby obtaining the student group Fm i The three subject areas of Fm i ={d1,d2,d3}, including the student group Fm i To select courses, Fm i ={(v1+v2+…+vm ),{c1,c2,…,c k}}, indicating the student group Fm i From the subject area j Course category c k The second management process is the route planning process, which determines the classroom floor and building number according to the selected course category, calculates the walking distance between different classrooms based on the Euclidean distance on the two-dimensional plane or the vertical and horizontal comprehensive distance according to the different floors, and calculates the shortest path from one classroom to another through the path planning algorithm.

[0006] As a further solution of the present invention, the timetable optimization and intelligent scheduling module takes the walking distance and time between teaching buildings as parameters, and sets the optimization goal to minimize the total moving distance of students between different courses within the time period. Specifically, the distance from each building to other buildings is represented by a distance matrix. According to the distance matrices of different buildings, the first walking time from one classroom to another is calculated. The interval time between each class is determined according to the course timetable to ensure that the first walking time does not exceed the interval time. The optimization goal is set to minimize the total moving distance of students between different courses. If a student has P courses in time period T, the classrooms where he is located are C1, C2, ..., C P , C1 is the classroom used for the first course, C2 is the classroom used for the second course, P The distance between any two classrooms is D(C p ,C p+1 ), the total moving distance of the students is expressed as:

[0007]

[0008] Where: Td is the total distance traveled by the student, P is the total number of courses the student takes in time period T, C p The classroom used for the pth course, C p+1 The classroom used for the p+1th course, D(C p ,C p+1 ) is the distance between the classroom used for the p-th course and the classroom used for the p+1-th course;

[0009] For students Fm i The optimization objective of minimizing the total moving distance is:

[0010]

[0011] Where: Td′ is the student population Fm i The minimum total moving distance.

[0012] As a further solution of the present invention, the student safety management notification module is used to automatically issue a warning when a crowded situation is detected in the corridor or stairs between classes, and evaluate the probability of an accident. Specifically, the video data of the corridor and the stairs between classes is obtained through a camera, and the number of people is identified and counted using a computer vision-based target detection algorithm. The number of people is divided by the total area of ​​the detection area to calculate the crowd density. If the crowd density exceeds a preset threshold, it is regarded as a crowded state. The dynamic change data of the personnel flow is detected, including the density of people entering and leaving the detection area. The density of people entering and leaving the detection area is imported into the accident probability evaluation model, wherein the formula of the accident probability evaluation model is:

[0013]

[0014] Δρ=ρ in -ρ out ;

[0015] Where: s h is the probability of an accident, exp is an exponential function, α is the weight parameter of the change rate of the crowd density, Δρ is the change rate of the crowd density, β is the weight parameter of the average crowd speed, and v avg is the average flow speed, γ is the weight parameter of the flow density entering the detection area, ρ in is the density of people entering the detection area, δ is the weight parameter of the density of people leaving the detection area, and ρ out It is the density of people leaving the detection area; if the probability of an accident is greater than the preset accident probability threshold, an alarm will be triggered to remind students and administrators to take corresponding measures; otherwise, there is no need to trigger an alarm.

[0016] An electronic device comprises: a memory storing executable program codes; a processor coupled to the memory; the processor calls the executable program codes stored in the memory to execute the above system.

[0017] A computer storage medium stores a computer program, which executes the above system when executed by a processor.

[0018] A computer program product comprises a computer program, wherein the computer program executes the above system when executed by a processor.

[0019] The technical effects and advantages of a student information management system of the present invention are as follows: the present invention uses a route planning module to automatically calculate the shortest path between different classrooms for students, thereby reducing students' moving time and allowing students to have more time between classes to rest and prepare for the next course; the timetable optimization and intelligent scheduling module dynamically adjusts the course schedule according to the walking distance and time between teaching buildings, thereby minimizing the total moving distance of students between different courses, avoiding students from being late or feeling tired due to running around, reducing the workload of manual scheduling and monitoring, greatly improving management efficiency, and reducing unreasonable arrangements due to human negligence or errors; the safety management notification module uses cameras and computer vision technology to monitor the flow of people in corridors and stairs in real time, automatically detects congestion and evaluates the probability of accidents. If the degree of congestion exceeds a preset threshold, the system will immediately issue a warning to remind students and administrators to take countermeasures, thereby preventing trampling or other safety accidents. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] Figure 1 A schematic diagram of the structure of a student information management system provided by the present invention;

[0021] Figure 2 This is a structural diagram of the student information management structure model. DETAILED DESCRIPTION

[0022] The following will be combined with the accompanying drawings in the present invention to clearly and completely describe the technical solution in the present invention. Obviously, the described technical solution is only a part of the present invention, not all of it. Based on the technical solution in the present invention, all other technical solutions obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0023] Figure 1 FIG. 2 shows a schematic diagram of the structure of a student information management system provided by the present invention. Figure 1 As shown, a student information management system in this embodiment includes a processor and a route planning module, a class schedule optimization and intelligent scheduling module, and a safety management notification module connected to the processor in communication;

[0024] The route planning module is used to build a student information management structure model based on the actual distance between the classroom floors and different teaching buildings, and automatically calculate the shortest path for students to go from one classroom to another;

[0025] The timetable optimization and intelligent scheduling module is used to optimize the timetable arrangement in combination with route planning, minimize the moving distance between two classes, take the walking distance and time between teaching buildings as parameters, and set the optimization goal to minimize the total moving distance between different courses within the time period;

[0026] The safety management notification module is used to automatically issue warnings when congestion is detected in the corridors or stairs between classes, assess the probability of accidents, and remind students and administrators to take appropriate measures.

[0027] Specifically, the route planning module is used to build a student information management structure model based on the actual distance between the classroom floor and different teaching buildings, and automatically calculate the shortest path for students from one classroom to another. Figure 2 The structural diagram of the student information management structural model shown in FIG. i , Subject Area j And course category c k The first management process is the course selection process, which is based on the subject area. j , placing courses from similar fields and research areas into the jth subject area d j Inside, that is Among them, c1 is the first course category, c2 is the second course category, and each course category includes m courses, that is, c k =(v1+v2+…+v m ), where v1 is the first type of course, v2 is the second type of course, and v m For the mth course; student group Fm i Ability to choose any one of the three subject areas (d1, d2, d3) k The priorities of these three subject areas are: primary (d1→D p ), Level 2 (d2→D s ) and level 3 (d3→D t ), where D p Primary subject area, refers to the core courses in the subject area, s It is a secondary subject area, which refers to the basic courses in the subject area. t It is a third-level subject area, which refers to non-core courses and non-basic courses in the subject area, thereby obtaining the student group Fm i The three subject areas of Fm i ={d1,d2,d3}, including the student group Fm i To select courses, Fm i ={(v1+v2+…+v m ),{c1,c2,…,c k}}, indicating the student group Fm i From the subject area j Course category c k choice.

[0028] The second management process is the route planning process. The classroom floor and building number are determined according to the selected course category. The building layout and floor information on campus are calculated based on the Euclidean distance on the two-dimensional plane or the vertical and horizontal comprehensive distances calculated according to the different floors. The walking distance between different classrooms is calculated separately, and the shortest path from one classroom to another is calculated through the path planning algorithm.

[0029] Through the route planning module, the system can automatically calculate the shortest path for students to get from one classroom to another, reduce the time students spend moving between classes, help them use their time between classes more efficiently, and avoid being late for class due to long walking distances. The timetable optimization and intelligent scheduling module optimizes according to the actual walking distance, so that the timetable arrangement minimizes the running of students between different classrooms, thereby reducing fatigue and improving students' learning experience; considering the space utilization rate of the classroom, the use of teaching buildings can be optimized by optimizing paths and reducing students' movement needs, so as to avoid overcrowding in some teaching buildings or classrooms while other classrooms are not fully utilized; the timetable optimization module dynamically adjusts according to the actual student course selection and classroom availability, reasonably allocates courses to appropriate classrooms, and improves the utilization efficiency of teaching resources; safety management The management and notification module can monitor the density of people in corridors and stairs in real time. When congestion is detected, the system will automatically issue a warning to remind students to avoid high-density areas and notify management personnel to take evacuation measures, effectively reducing the risk of accidents (such as trampling and falling); based on data such as crowd density and flow speed, the system can evaluate the probability of accidents and issue timely warnings to help management personnel prevent potential safety hazards in advance and improve the overall safety of the campus; each student's course selection path is independent, and personalized path planning is generated according to each student's specific course selection and campus layout to ensure that their learning and walking routes are optimal and reduce invalid time; by optimizing students' walking routes and class schedules, it can avoid a large number of students gathering in certain specific teaching buildings or corridors at the same time period, reducing congestion on campus.

[0030] Specifically, the timetable optimization and intelligent scheduling module uses the walking distance and time between teaching buildings as parameters, and sets the optimization goal to minimize the total moving distance of students between different courses within the time period. Specifically, the distance matrix is ​​used to represent the distance from each building to other buildings. According to the distance matrices of different buildings, the first walking time from one classroom to another is calculated. The interval between each class is determined according to the course schedule to ensure that the first walking time does not exceed the interval time. The optimization goal is set to minimize the total moving distance of students between different courses. If a student has P courses in time period T, the classrooms where he is located are C1, C2, …, C P , C1 is the classroom used for the first course, C2 is the classroom used for the second course, PThe distance between any two classrooms is D(C p ,C p+1 ), the total moving distance of the students is expressed as:

[0031]

[0032] Where: Td is the total distance traveled by the student, P is the total number of courses the student takes in time period T, C p The classroom used for the pth course, C p+1 The classroom used for the p+1th course, D(C p ,C p+1 ) is the distance between the classroom used for the p-th course and the classroom used for the p+1-th course;

[0033] For students Fm i The optimization objective of minimizing the total moving distance is:

[0034]

[0035] Where: Td′ is the student population Fm i The minimum total moving distance.

[0036] Specifically, in order to better realize the student group Fm i To optimize the minimization of the total moving distance, the system pre-randomly generates an initial course schedule, schedules classes according to the current student schedule data, calculates the total moving distance for each student under the current schedule, randomly selects two courses of a student, tries to exchange their classrooms or time periods, and recalculates the new total moving distance. If the new arrangement reduces the total moving distance, the new arrangement is accepted; if the new arrangement does not reduce the total moving distance, the original arrangement is maintained. Through multiple iterations, the goal of minimizing the total moving distance is found.

[0037] The distance matrix represents the distance from each building to other buildings. The distance matrix D is an r×r matrix, where r is the number of buildings. sg represents the walking distance from the sth building to the jth building. If s = j, then the distance matrix D sg =0, because the distance from a building to itself is 0. Assuming there are 4 buildings on campus: Building A, Building B, Building C, and Building D, the distance matrix is ​​represented as follows:

[0038]

[0039] Where: D BA is the walking distance from building B to building A, D CAis the walking distance from the Cth building to the Ath building, D DA is the walking distance from the Dth building to the Ath building, D AB is the walking distance from building A to building B, D CB is the walking distance from building C to building B, D DB is the walking distance from the Dth building to the Bth building, D AC is the walking distance from building A to building B, D BC is the walking distance from building B to building C, D DC is the walking distance from the Dth building to the Cth building, D AD is the walking distance from building A to building D, D BD is the walking distance from the Bth building to the Dth building, D CD is the walking distance from the Cth building to the Dth building. The row and column indices represent building A, building B, building C, and building D respectively.

[0040] The distance matrix is ​​used to calculate the walking distance between each teaching building, and the course schedule is determined to minimize the total moving distance of students within time period T, so that the moving time of students between different teaching buildings is effectively reduced, avoiding frequent running around. By using the distance matrix to represent the walking distance between each building, the shortest path is planned for each student to ensure that they can reach the next classroom quickly and efficiently during the break, avoiding lateness or unnecessary waste of time; through multiple iterations of optimizing the course schedule, try to exchange the classroom or time period of the course to ensure that the moving distance of students between different courses is the shortest, and automatically adjust the course sequence or classroom arrangement according to the actual situation to ensure that the class schedule is more reasonable and effective; according to the interval time between each class and the distance between the teaching buildings, ensure that students can get from one classroom to another within a reasonable time, thereby avoiding too short or too long breaks between classes and improving the learning experience; by optimizing the course schedule, the use of each teaching building can be balanced to ensure that the resources of different buildings and classrooms are evenly distributed, avoiding some buildings from being too crowded The system can automatically optimize the schedule and walking path of each student according to the specific course schedule and distance matrix of each student, so that students can complete the learning tasks of the day more efficiently under the optimal path and schedule provided by the system. By optimizing the schedule and classroom arrangement, a large number of students can be avoided from being concentrated in the same teaching building or floor at the same time, thereby reducing the congestion of corridors and stairs on campus and improving the mobility on campus. By reasonably allocating the course schedules of each teaching building, the flow of people in a single building or area can be avoided from being too concentrated, further reducing the risk of congestion on campus.

[0041] Specifically, the student safety management notification module is used to automatically issue a warning when a crowded situation is detected in the corridor or stairs between classes, and evaluate the probability of an accident. Specifically, the video data of the corridor and stairs between classes is obtained through the camera, and the target detection algorithm based on computer vision is used to identify and count the number of people. The number of people is divided by the total area of ​​the detection area to calculate the crowd density. If the crowd density exceeds the preset threshold, it is considered to be a crowded state. The dynamic change data of the personnel flow is detected, including the density of people entering and leaving the detection area. The density of people entering and leaving the detection area is imported into the accident probability assessment model, where the formula of the accident probability assessment model is:

[0042]

[0043] Δρ=ρ in -ρ out ;

[0044] Where: s h is the probability of an accident, exp is an exponential function, α is the weight parameter of the change rate of the crowd density, Δρ is the change rate of the crowd density, β is the weight parameter of the average crowd speed, and v avg is the average flow speed, γ is the weight parameter of the flow density entering the detection area, ρ in is the density of people entering the detection area, δ is the weight parameter of the density of people leaving the detection area, and ρ out It is the density of people leaving the detection area; if the probability of an accident is greater than the preset accident probability threshold, an alarm will be triggered to remind students and administrators to take corresponding measures; otherwise, there is no need to trigger an alarm.

[0045] By combining cameras with computer vision technology to monitor the flow of people in corridors and stairs in real time, the system can continuously collect data to ensure that crowded or potentially dangerous situations can be discovered in the first place. When the system detects that the density or dynamic changes of the flow of people exceed the preset threshold, the accident probability assessment model will immediately calculate the risk of an accident and automatically trigger an alarm when necessary to remind students and managers to ensure a quick response and reduce safety hazards. Through data on flow density, flow speed and dynamic changes, the system can accurately assess the probability of an accident and can be continuously updated based on real-time data to help managers effectively prevent accidents and reduce the possibility of accidents such as trampling and pushing. Through dynamic monitoring of the flow density of people entering and leaving the area, it can accurately identify abnormalities in the flow of people and make timely predictions. Dangerous situations help schools better manage peak traffic; if the probability of an accident exceeds the set threshold, the system will automatically trigger an alarm to remind students and staff in crowded areas to take appropriate risk avoidance measures, which helps prevent accidents or mitigate their impact. Through alarm notifications, managers can quickly understand possible crowded areas and rush to the scene for guidance and intervention, effectively alleviating the pressure of crowds during peak hours; real-time detection of different areas on campus, especially corridors and stairs, automatically identifies dynamic changes in crowd density, helps schools arrange student flow more reasonably, and reduces congestion between different areas. Through computer vision-based target detection and accident probability assessment models, the system can realize automated monitoring, reduce dependence on manual monitoring, and reduce management costs.

[0046] An electronic device comprises: a memory storing executable program code; a processor coupled to the memory; the processor calls the executable program code stored in the memory to execute the above-mentioned network data information security protection system.

[0047] A computer storage medium stores a computer program, which executes the above-mentioned network data information security protection system when run by a processor.

[0048] A computer program product comprises a computer program, wherein the computer program executes the above-mentioned network data information security protection system when being run by a processor.

[0049] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0050] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable load balancing device, so that when the program code is executed by the processor or controller, the functions / operations specified in the flow chart and / or block diagram are implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0051] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0052] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.

[0053] In the embodiment of the present invention, through the route planning module, the system automatically calculates the shortest path between different classrooms for students, reduces the students' moving time, and allows students to have more time to rest and prepare for the next course between classes; the timetable optimization and intelligent scheduling module dynamically adjusts the course schedule according to the walking distance and time between teaching buildings, minimizes the total moving distance of students between different courses, avoids students being late or tired due to running around, reduces the workload of manual scheduling and monitoring, greatly improves management efficiency, and reduces unreasonable arrangements due to human negligence or errors; the safety management notification module monitors the flow of people in corridors and stairs in real time through cameras and computer vision technology, automatically detects congestion and evaluates the probability of accidents. If the degree of congestion exceeds the preset threshold, the system will immediately issue a warning to remind students and administrators to take countermeasures, thereby preventing trampling or other safety accidents.

[0054] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0055] Finally: The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A student information management system, comprising a processor and a route planning module, a timetable optimization and intelligent scheduling module and a safety management notification module connected to the processor, characterized in that: The route planning module is used to build a student information management structure model according to the actual distance between the floor where the classroom is located and different teaching buildings, and automatically calculate the shortest path for students from one classroom to another; the timetable optimization and intelligent scheduling module is used to optimize the timetable arrangement in combination with route planning, minimize the moving distance between two classes, take the walking distance and time between teaching buildings as parameters, and set the optimization goal to minimize the total moving distance between different courses of students during the period; the safety management notification module is used to automatically issue a warning when congestion in the corridor or stairs between classes is detected, and evaluate the probability of accidents, and remind students and administrators to take corresponding measures; the route planning module is used to build a student information management structure model according to the actual distance between the floor where the classroom is located and different teaching buildings, and automatically calculate the shortest path for students from one classroom to another, where the student information management structure model consists of the student group Fm i , Subject Area j And course category c k The first management process is the course selection process, which is based on the subject area. j , put courses from similar fields and research areas into the jth subject area d j Inside, that is Among them, c1 is the first course category, c2 is the second course category, and each course category includes m courses, that is, c k =(v1+v2+…+v m ), where v1 is the first type of course, v2 is the second type of course, and v m For the mth course; student group Fm i Ability to choose any one of the three subject areas (d1, d2, d3) k The priorities of these three subject areas are: primary (d1→D p ), Level 2 (d2→D s ) and level 3 (d3→D t ), where D p Primary subject area, refers to the core courses in the subject area, s It is a secondary subject area, which refers to the basic courses in the subject area. t It is a third-level subject area, which refers to non-core courses and non-basic courses in the subject area, thereby obtaining the student group Fm i The three subject areas of Fm i = {d1, d2, d3}, including the student group Fm i To select courses, Fm i ={(v1+v2+…+v m ), {c1, c2, …, c k }}, indicating the student group Fm i From the subject area j Conducting courses in category c k The second management process is the route planning process, which determines the classroom floor and building number according to the selected course category, calculates the walking distance between different classrooms based on the Euclidean distance on the two-dimensional plane or the vertical and horizontal comprehensive distance according to the different floors, and calculates the shortest path from one classroom to another through the path planning algorithm.

2. A student information management system according to claim 1, characterized in that: The timetable optimization and intelligent scheduling module uses the walking distance and time between teaching buildings as parameters, and sets the optimization goal to minimize the total moving distance of students between different courses within the time period. Specifically, the distance matrix is ​​used to represent the distance from each building to other buildings. According to the distance matrix of different buildings, the first walking time from one classroom to another is calculated. The interval between each class is determined according to the course schedule to ensure that the first walking time does not exceed the interval time. The optimization goal is set to minimize the total moving distance of students between different courses. If a student has P courses in time period T, his classroom is C1, C2, ..., C P , C1 is the classroom used for the first course, C2 is the classroom used for the second course, P The distance between any two classrooms is D(C p , C p+1 ), the total moving distance of the students is expressed as: Where: Td is the total distance traveled by the student, P is the total number of courses the student takes in time period T, C p The classroom used for the pth course, C p+1 The classroom used for the p+1th course, D(C p , C p+1 ) is the distance between the classroom used for the p-th course and the classroom used for the p+1-th course; For students Fm i The optimization objective of minimizing the total moving distance is: Where: Td′ is the student population Fm i The minimum total moving distance.

3. A student information management system according to claim 2, characterized in that: The student safety management notification module is used to automatically issue a warning when a crowded situation is detected in the corridor or stairs between classes, and to evaluate the probability of an accident. Specifically, the video data of the corridor and stairs between classes is obtained through the camera, and the target detection algorithm based on computer vision is used to identify and count the number of people. The number of people is divided by the total area of ​​the detection area to calculate the crowd density. If the crowd density exceeds the preset threshold, it is considered to be a crowded state. The dynamic change data of the personnel flow is detected, including the density of people entering and leaving the detection area. The density of people entering and leaving the detection area is imported into the accident probability assessment model, where the formula of the accident probability assessment model is: Dr=r in -rou t ; Where: s h is the probability of an accident, exp is an exponential function, α is the weight parameter of the change rate of the crowd density, Δρ is the change rate of the crowd density, β is the weight parameter of the average crowd speed, and v avg is the average flow speed, γ is the weight parameter of the flow density entering the detection area, ρ in is the density of people entering the detection area, δ is the weight parameter of the density of people leaving the detection area, and ρ out It is the density of people leaving the detection area; if the probability of an accident is greater than the preset accident probability threshold, an alarm will be triggered to remind students and administrators to take corresponding measures; otherwise, there is no need to trigger an alarm.

4. An electronic device, comprising: A memory storing executable program code; A processor coupled to the memory; characterized in that: the processor calls the executable program code stored in the memory to execute the system as described in any one of claims 1-3.

5. A computer storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the system according to any one of claims 1 to 3 is executed.

6. A computer program product, comprising a computer program, characterized in that: When the computer program is executed by a processor, the system according to any one of claims 1 to 3 is executed.

Citation Information

Cited By

  • Classroom attention monitoring method and device, equipment and storage medium

    CN120599540A

  • Space-time conflict detection-based postgraduate student-oriented course selection method and server

    CN121458226A

  • A method and server for course selection for graduate students based on spatiotemporal conflict detection

    CN121458226B