A wireless charging scheduling method, system, electronic device and storage medium for minimizing maximum return to work time
By building the maximum return time optimization model, the impact of charging time on network performance in the wireless rechargeable sensor network is solved, the charging sequence and location of heterogeneous devices are optimized, and the maximum return time of mobile rechargeable devices is minimized , improves network efficiency.
Patent Information
- Application Number
- CN202410652405.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-05-23
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2044-05-23
AI Technical Summary
The impact of charging time on network performance in existing wireless rechargeable sensor networks has not been fully considered, and the performance differences of heterogeneous devices and the limited space of chargers cause equipment to wait in line, affecting the maximum return time.
By building a maximum return time optimization model, the charging potential allocation scheme and charging sequence are determined based on the departure time and charging time of the mobile rechargeable equipment, and the charging time is optimized to ensure that the charging needs of all devices are met and the maximum return time is minimized.
On the premise of meeting the charging needs of all devices, the charging time of heterogeneous mobile rechargeable devices is optimized, the maximum return time of mobile rechargeable devices is minimized, and the working efficiency of the network is improved.
Smart Images

Figure CN118586629B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of wireless charging technology, and in particular to a wireless charging scheduling method, system, electronic device and storage medium that minimizes maximum return-to-work time. Background Art
[0002] In recent years, the application scope of wireless sensor networks has become increasingly wide. Sensor nodes are powered by batteries with limited power, and the service life of sensors will seriously affect the life cycle of wireless sensor networks. Therefore, how to extend the life cycle of the network is a key issue related to network performance. Wireless power transmission has attracted more and more attention from academia and industry, and wireless power transmission technology is used to solve the energy supply problem of nodes in wireless sensor networks. Wireless power transmission technology is a promising technology that can extend the life of the network. There have been many studies on its energy transmission efficiency and scalability. For example, there is a multi-node charging scheme that can charge multiple sensors at the same time by appropriately adjusting the operating frequency of the transmitter and receiver coils, thereby achieving high energy transmission efficiency and a longer energy transmission range; wireless energy transmission based on magnetic resonance has higher charging efficiency and can greatly expand the charging range of the charger. Combining wireless power transmission technology with wireless sensor networks will produce wireless rechargeable sensor networks.
[0003] Most of the existing charging solutions for wireless rechargeable sensor networks focus on optimizing charging efficiency or charging cost, optimizing scheduling strategies to improve task utility, or considering shortening the charging travel time of mobile chargers, often ignoring the impact of charging time on the network. However, charging is exclusive, that is, in practice, many rechargeable devices cannot be charged and event sensed or monitored at the same time due to their hardware characteristics. Therefore, long-term charging will directly affect the task execution of devices in wireless rechargeable sensor networks, resulting in reduced work efficiency of devices in wireless rechargeable sensor networks. In addition, since rechargeable devices and wireless chargers may not be purchased at the same time, the performance of rechargeable devices or chargers is different. However, most current studies assume that rechargeable devices or chargers are isomorphic, without considering the performance differences between rechargeable devices or chargers. In some large-scale wireless rechargeable sensor networks (such as large-scale reconnaissance or transport drone groups), there are a large number of rechargeable devices that need to be charged in a short time. However, since rechargeable devices need to occupy a certain space, the charging positions within the charging range of the charger are limited, and a large number of rechargeable devices cannot be charged at the same time. Therefore, there may be a situation where rechargeable devices wait in line, and few studies consider the queuing problem during charging. Summary of the invention
[0004] The main purpose of the present invention is to overcome the shortcomings and deficiencies of the prior art, and to provide a wireless charging scheduling method, system, electronic device and storage medium for minimizing the maximum return time, which optimizes the charging time of heterogeneous mobile rechargeable devices, determines the charging position and charging sequence of all devices while meeting the charging needs of all devices, and minimizes the maximum return time of mobile rechargeable devices.
[0005] According to one aspect of the present invention, the present invention provides a wireless charging scheduling method for minimizing the maximum return time, the method comprising the following steps:
[0006] Determine the return time of the mobile rechargeable device according to its different departure time, moving time and charging time, and build a maximum return time optimization model for the mobile rechargeable device;
[0007] Determining a charging position allocation scheme for the mobile rechargeable devices according to the non-increasing order of departure times of the mobile rechargeable devices;
[0008] According to the charging allocation scheme, the charging sequence of each mobile rechargeable device is determined according to the arrival time of the mobile rechargeable device to optimize the maximum return time.
[0009] Preferably, determining the return time of the mobile rechargeable device according to different departure times, movement times and charging times of the mobile rechargeable device comprises:
[0010] Mobile rechargeable devices i The return time is:
[0011]
[0012]
[0013]
[0014] in, For mobile rechargeable devices i Dispatch to charging position jk Charging time for charging, For mobile rechargeable devices i Move to charger c j The moving time of each charging position, Indicates the charging position γ jk The charging start time of the mobile rechargeable device with charging order l, E i For charging needs, P jk For mobile rechargeable devices in charging stations γ jk The charging power received at ij For mobile rechargeable devices i With charger cj The path length between each charging position, v i For mobile rechargeable devices i The moving speed, r i For mobile rechargeable devices i The departure time of the mobile rechargeable device is the lth in the charging queue, and the charging order l indicates that the mobile rechargeable device is in the lth position in the charging queue. jk (l) represents the charging position γ jk The above charging sequence is 1 for mobile rechargeable devices.
[0015] Preferably, the construction of the maximum return time optimization model for mobile rechargeable equipment includes:
[0016] Let the maximum return time T be the maximum time for the mobile rechargeable devices in the set S to return to their original positions, that is
[0017]
[0018] The problem of minimizing the maximum return time of mobile rechargeable equipment is constructed and formalized as follows:
[0019] min T
[0020]
[0021]
[0022]
[0023]
[0024] Among them, ω jk (l) = s i ; Each charger c j ∈C has ρ j charging positions, S represents the set of mobile rechargeable devices, C represents the set of static chargers, S jk Indicates that the charging position is γ jk A subset of mobile rechargeable devices that are charged at Indicates the size of the set, x ijkl =1 means moving the rechargeable device s i Dispatch to charging position jk The charging sequence is l, otherwise, let x ijkl =0; is the remaining power, For mobile rechargeable devices i ∈S battery capacity, For mobile rechargeable devices i Move to charger c j The mobile energy consumption of each charging position.
[0025] Preferably, determining the charging position allocation scheme for the mobile rechargeable devices according to the non-increasing order of the departure time of the mobile rechargeable devices comprises:
[0026] (4.1) For each charging position γ jk , c j ∈C, k∈{1, 2, … ρ j}, initialize the charging position γ jk A subset of mobile rechargeable devices Initialize charging position jk Charging queue for mobile rechargeable devices Initialize charging position jk Free time
[0027] (4.2) Sort the mobile rechargeable devices in non-increasing order according to their departure time to obtain a mobile rechargeable device sequence S′;
[0028] (4.3) According to the obtained device sequence S′, each mobile rechargeable device s in S′ is i Select the charging position that minimizes the current charging completion time, that is,
[0029]
[0030] Move rechargeable devices i Join Charging Station jk Mobile rechargeable device subset S jk and update the idle time of the charging position:
[0031]
[0032] (4.4) Repeat step (4.3) until charging positions are selected for all mobile rechargeable devices.
[0033] Preferably, the step of determining the charging order of each mobile rechargeable device according to the arrival time of the mobile rechargeable device according to the charging allocation scheme to optimize the maximum return time comprises:
[0034] (5.1) For any charge position γ jk , c j ∈C, k∈{1, 2, … ρ j}, calculate the charging position γ jk The device subset S jk Mobile rechargeable devices i ∈S jk The arrival time, i.e. And sort them in non-decreasing order of the value to get the charge position γ jkThe charging queue Ω jk ;
[0035] (5.2) For any charge position γ jk , reinitialize the idle time of the charging position And initialize the charging sequence l=1;
[0036] (5.3) For any charge position γ jk The charging queue Ω jk , calculate each mobile rechargeable device s in turn i ∈Ω jk Start charging time:
[0037]
[0038] Counting mobile rechargeable devices i Return time:
[0039]
[0040] Update the charging sequence l=l+1 and update the idle time of the charging position
[0041] (5.4) Repeat steps (5.2) and (5.3) until the charging sequence, charging start time and return time of all mobile rechargeable devices are obtained;
[0042] (5.5) Output the charging plan Ω, including the charging positions and charging sequence of all mobile rechargeable devices, and output the charging start time and return time of all mobile rechargeable devices.
[0043] According to another aspect of the present invention, the present invention also provides a wireless charging scheduling system for minimizing the maximum return time, the system comprising:
[0044] A construction module is used to determine the return time of the mobile rechargeable device according to different departure times, movement times and charging times of the mobile rechargeable device, and to construct a maximum return time optimization model for the mobile rechargeable device;
[0045] A determination module, used to determine a charging position allocation scheme for the mobile rechargeable devices according to the non-increasing order of the departure time of the mobile rechargeable devices;
[0046] The optimization module is used to determine the charging order of each mobile rechargeable device according to the charging allocation plan and the arrival time of the mobile rechargeable device to optimize the maximum return time.
[0047] Preferably, the construction module determines the return time of the mobile rechargeable device according to different departure times, movement times and charging times of the mobile rechargeable device, including:
[0048] Mobile rechargeable devices i The return time is:
[0049]
[0050]
[0051]
[0052] in, For mobile rechargeable devices i Dispatch to charging position jk Charging time for charging at For mobile rechargeable devices i Move to charger c j The moving time of each charging position, Indicates the charging position γ jk The charging start time of the mobile rechargeable device with charging order l, E i For charging needs, P jk For mobile rechargeable devices in charging stations γ jk The charging power received at ij For mobile rechargeable devices i With charger c j The path length between each charging position, v i For mobile rechargeable devices i The moving speed, r i For mobile rechargeable devices i The departure time of the mobile rechargeable device is the lth in the charging queue, and the charging order l indicates that the mobile rechargeable device is in the lth position in the charging queue. jk (l) represents the charging position γ jk The above charging sequence is 1 for mobile rechargeable devices.
[0053] Preferably, the construction module constructs a maximum return time optimization model for mobile rechargeable equipment, including:
[0054] Let the maximum return time T be the maximum time for the mobile rechargeable devices in the set S to return to their original positions, that is
[0055]
[0056] The problem of minimizing the maximum return time of mobile rechargeable equipment is constructed and formalized as follows:
[0057] min T
[0058]
[0059]
[0060]
[0061]
[0062] Among them, ω jk (l) = s i ; Each charger c j ∈C has ρ j charging positions, S represents the set of mobile rechargeable devices, C represents the set of static chargers, S jk Indicates that the charging position is γ jk A subset of mobile rechargeable devices that are charged at Indicates the size of the set, x ijkl =1 means moving the rechargeable device s i Dispatch to charging position jk The charging sequence is l, otherwise, let x ijkl =0; is the remaining power, For mobile rechargeable devices i ∈S battery capacity, For mobile rechargeable devices i Move to charger c j The mobile energy consumption of each charging position.
[0063] According to another aspect of the present invention, the present invention further provides an electronic device, comprising: a processor and a memory, wherein the memory stores computer executable instructions, and the computer executable instructions implement the above method steps when executed by the processor.
[0064] According to another aspect of the present invention, the present invention further provides a computer-readable storage medium, characterized in that the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions implement the above method steps when executed by a processor.
[0065] Beneficial effects: The present invention optimizes the charging time of heterogeneous mobile rechargeable devices, determines the charging positions and charging sequence of all devices while meeting the charging requirements of all devices, and minimizes the maximum return time of mobile rechargeable devices.
[0066] The features and advantages of the present invention will become clear through reference to the following drawings and detailed description of specific embodiments of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS
[0067] Figure 1 is a flow chart of a wireless charging scheduling method for minimizing the maximum return time;
[0068] Figure 2 It is a schematic diagram of the system model of the wireless charging scheduling method for minimizing the maximum return time;
[0069] Figure 3 is a flow chart of a charging position allocation method of a wireless charging scheduling method that minimizes the maximum return time;
[0070] Figure 4 It is a flow chart of a charging sequence decision method of a wireless charging scheduling method that minimizes the maximum return time;
[0071] Figure 5 It is a schematic diagram of the wireless charging scheduling system with the maximum return time minimized. DETAILED DESCRIPTION
[0072] The following is a clear and complete description of the technical solutions in the embodiments of the present invention in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0073] Example 1
[0074] Figure 1 This is a flow chart of the wireless charging scheduling method that minimizes the maximum return time. Figure 1 As shown, this embodiment provides a wireless charging scheduling method for minimizing the maximum return time, and the method includes the following steps:
[0075] S1: Determine the return time of the mobile rechargeable device according to the different departure time, moving time and charging time of the mobile rechargeable device, and build a maximum return time optimization model for the mobile rechargeable device;
[0076] S2: Determine a charging position allocation scheme for the mobile rechargeable device according to the non-increasing order of the departure time of the mobile rechargeable device;
[0077] S3: According to the charging allocation scheme, the charging sequence of each mobile rechargeable device is determined according to the arrival time of the mobile rechargeable device to optimize the maximum return time.
[0078] The method determines the charging position allocation scheme of mobile rechargeable devices according to the non-increasing order of the departure time of the mobile rechargeable devices, optimizes the charging time of heterogeneous mobile rechargeable devices, and minimizes the maximum return time of the mobile rechargeable devices.
[0079] Preferably, determining the return time of the mobile rechargeable device according to different departure times, movement times and charging times of the mobile rechargeable device comprises:
[0080] Mobile rechargeable devices i The return time is:
[0081]
[0082]
[0083]
[0084] in, For mobile rechargeable devices i Dispatch to charging position jk Charging time for charging, For mobile rechargeable devices i Move to charger c j The moving time of each charging position, Indicates the charging position γ jk The charging start time of the mobile rechargeable device with charging order l, E i For charging needs, P jk For mobile rechargeable devices in charging stations γ jk The charging power received at ij For mobile rechargeable devices i With charger c j The path length between each charging position, v i For mobile rechargeable devices i The moving speed, r i For mobile rechargeable devices i The departure time of the mobile rechargeable device is the lth in the charging queue, and the charging order l indicates that the mobile rechargeable device is in the lth position in the charging queue. jk (l) represents the charging position γ jk The above charging sequence is 1 for mobile rechargeable devices.
[0085] Specifically, let S = {s1, s2, ...s n} represents a set of mobile rechargeable devices, C = {c1, c2, ...c m} represents a static charger collection;
[0086] Mobile rechargeable devices i The battery capacity of ∈S is The remaining power is Charging requirement is E i , the moving speed is v i , the energy consumption per unit distance is
[0087] Each charger c j ∈C has ρ j charging positions, where j = 1, 2, ..., m; let γjk Indicates that the charger c j The kth (k∈{1, 2, …, ρ j}) charging positions, mobile rechargeable devices are in the charging position γ jk The charging power received at jk .
[0088] See also Figure 2 , before charging, each mobile rechargeable device s i Send a charging request to the base station, the charging request includes the mobile rechargeable device s i Location, battery capacity Remaining power Charging requirement E i , departure time i , moving speed v i and unit moving energy consumption When a mobile rechargeable device sends a charging request to the base station, it may be performing a corresponding task and cannot immediately go to the charger to charge, so the departure time of each device may be different; the base station calculates the charging schedule and sends the charging schedule to the mobile rechargeable device. After receiving the scheduling plan from the base station, the mobile rechargeable device will move to the charging position of the assigned charger to charge;
[0089] Mobile rechargeable devices i With charger c j The path length between each charging position is d ij . Mobile rechargeable devices i Move to charger c j The moving time of each charging position is:
[0090]
[0091] Mobile rechargeable devices i Move to charger c j The mobile energy consumption of each charging position is:
[0092]
[0093] After the mobile rechargeable device is fully charged, it needs to return to its original position to continue working. Therefore, it will cost Time goes back and consumes energy Charging requirements of mobile rechargeable devices i In fact, it is the remaining energy after it completes charging and returns to its initial position compared to before charging. Compared with the increased energy. Therefore, the energy actually obtained by the mobile rechargeable device from the charger is If you have mobile rechargeable devicesi Dispatch to charging position jk The charging time is:
[0094]
[0095] Allow mobile rechargeable devices to queue up at the charging station to wait for charging; let S jk Indicates that the charging position is γ jk A subset of mobile rechargeable devices that are charged at. Let the charging scheduling scheme be Ω, let Ω jk =(ω jk (1),ω jk (2),…,ω jk (|S jk |)),Ω jk ∈Ω,c j ∈C, k∈{1, 2, …, ρ j} indicates that it is in the charging position γ jk The charging queue of the mobile rechargeable device, where ω jk (l) represents the charging position γ jk The charging order of the mobile rechargeable device is l, and the charging order l means that the mobile rechargeable device is ranked lth in the charging queue. Indicates the size of the set.
[0096] make Indicates the charging position γ jk The charging start time of the mobile rechargeable device with charging order l,
[0097]
[0098] Among them, mobile rechargeable devices i′ In charging position jk The charging sequence on jk (l-1).
[0099] Mobile rechargeable devices i The return time is:
[0100]
[0101] Preferably, the construction of the maximum return time optimization model for mobile rechargeable equipment includes:
[0102] Let the maximum return time T be the maximum time for the mobile rechargeable devices in the set S to return to their original positions, that is
[0103]
[0104] The problem of minimizing the maximum return time of mobile rechargeable equipment is constructed and formalized as follows:
[0105] min T
[0106]
[0107]
[0108]
[0109]
[0110] Among them, ω jk (l) = s i ; Each charger c j ∈C has ρ j charging positions, S represents the set of mobile rechargeable devices, C represents the set of static chargers, S jk Indicates that the charging position is γ jk A subset of mobile rechargeable devices that are charged at Indicates the size of the set, x ijkl =1 means moving the rechargeable device s i Dispatch to charging position jk The charging sequence is l, otherwise, let x ijkl =0; is the remaining power, For mobile rechargeable devices i ∈S battery capacity, For mobile rechargeable devices i Move to charger c j The mobile energy consumption of each charging position.
[0111] Specifically, let the binary decision variable X = {x ijkl |s i ∈S,c j ∈C, k∈{1, 2, …, ρ j}, l∈{1, 2, …, |S jk |}}(x ijkl ={0,1}), x ijkl =1 means moving the rechargeable device s i Dispatch to charging position jk The charging sequence is l, otherwise, let x ijkl =0;
[0112] Let the maximum return time T be the maximum time for the mobile rechargeable devices in the set S to return to their original positions, that is
[0113]
[0114] where ω jk (l) = si ;
[0115] The problem of minimizing the maximum return time of mobile rechargeable equipment is constructed and formalized as follows:
[0116] min T (7)
[0117]
[0118]
[0119]
[0120]
[0121] Among them, constraints (8) and (9) ensure that any mobile rechargeable device can and can only be charged at one charging station in a unique charging sequence, constraint (10) ensures that the remaining power of the mobile rechargeable device can support its movement to the charging station farthest from it, and constraint (11) ensures that its charging needs can be met.
[0122] Preferably, determining the charging position allocation scheme for the mobile rechargeable devices according to the non-increasing order of the departure time of the mobile rechargeable devices comprises:
[0123] (4.1) For each charging position γ jk , c j ∈C, k∈{1, 2, … ρ j}, initialize the charging position γ jk A subset of mobile rechargeable devices Initialize charging position jk Charging queue for mobile rechargeable devices Initialize charging position jk Free time
[0124] (4.2) Sort the mobile rechargeable devices in non-increasing order according to their departure time to obtain a mobile rechargeable device sequence S′;
[0125] (4.3) According to the obtained device sequence S′, each mobile rechargeable device s in S′ is i Select the charging position that minimizes the current charging completion time, that is,
[0126]
[0127] Move rechargeable devices i Join Charging Station jk Mobile rechargeable device subset S jk and update the idle time of the charging position:
[0128]
[0129] (4.4) Repeat step (4.3) until charging positions are selected for all mobile rechargeable devices.
[0130] The specific implementation process of this step can be found in Figure 3 shown.
[0131] Preferably, the step of determining the charging order of each mobile rechargeable device according to the arrival time of the mobile rechargeable device according to the charging allocation scheme to optimize the maximum return time comprises:
[0132] (5.1) For any charge position γ jk , c j ∈C, k∈{1, 2, … ρ j}, calculate the charging position γ jk The device subset S jk Mobile rechargeable devices i ∈S jk The arrival time, i.e. And sort them in non-decreasing order of the value to get the charge position γ jk The charging queue Ω jk ;
[0133] (5.2) For any charge position γ jk , reinitialize the idle time of the charging position And initialize the charging sequence l=1;
[0134] (5.3) For any charge position γ jk The charging queue Ω jk , calculate each mobile rechargeable device s in turn i ∈Ω jk Start charging time:
[0135]
[0136] Counting mobile rechargeable devices i Return time:
[0137]
[0138] Update the charging sequence l=l+1 and update the idle time of the charging position
[0139] (5.4) Repeat steps (5.2) and (5.3) until the charging sequence, charging start time and return time of all mobile rechargeable devices are obtained;
[0140] (5.5) Output the charging plan Ω, including the charging positions and charging sequence of all mobile rechargeable devices, and output the charging start time and return time of all mobile rechargeable devices.
[0141] The specific implementation process of this step can be found in Figure 4 shown.
[0142] This embodiment optimizes the charging time of heterogeneous mobile rechargeable devices, determines the charging positions and charging sequence of all devices while meeting the charging requirements of all devices, and minimizes the maximum return time of mobile rechargeable devices.
[0143] In order to more fully understand the present invention, another example is given below.
[0144] Assume S = {s1, s2, s3, s4, s5, s6, s7, s8, s9} represents the set of mobile rechargeable devices, and the charger set is C = {c1, c2, c3}. The coordinates of the mobile rechargeable devices are (3, 16), (5, 25), (6, 36), (17, 17), (22, 3), (25, 33), (27, 22), (35, 24) and (36, 13); the charging requirements of the mobile rechargeable devices are 312, 296, 268, 383, 267, 357, 269, 298 and 335 joules respectively, and ensure that the charging requirements of the mobile rechargeable devices are not greater than the maximum energy they can receive; The moving speeds of the mobile rechargeable devices are 1.4, 1.0, 0.7, 0.5, 1.5, 1.6, 1.2, 0.9 and 1.3 m / s respectively; the moving energy consumption of the mobile rechargeable devices is 5.9, 8.2, 8.9, 6.4, 6.6, 9.2, 5.9, 5.1 and 7.0 J / m respectively; the departure time of the mobile rechargeable devices is 3.1, 1.8, 9.9, 7.7, 2.6, 4.1, 3.4, 7.8 and 9.1 minutes respectively. The coordinates of the chargers are (10, 10), (30, 10) and (20, 30) respectively, and the number of charging positions is ρ1=2, ρ2=3 and ρ3=2 respectively; the charging power of each charging position is 23, 31, 24, 40, 29, 21 and 37 mW respectively according to the battery capacity.
[0145] In this embodiment, according to the non-increasing order of the departure time of the mobile rechargeable device as described above, the charging position allocation scheme of the mobile rechargeable device is determined, including:
[0146] (4.1) For each charging position γ jk , c j ∈C, k∈{1, 2, … ρ j}, initialize the charging position γ jk A subset of mobile rechargeable devices Initialize charging positionjk Charging queue for mobile rechargeable devices Initialize charging position jk Free time
[0147] (4.2) Without considering the round-trip travel time of the mobile rechargeable devices, the mobile rechargeable devices are sorted in non-increasing order according to their departure time, and a mobile rechargeable device sequence S′={s3, s9, s8, s4, s6, s7, s1, s5, s2} is obtained;
[0148] (4.3) According to the obtained mobile rechargeable device sequence S′, select the mobile rechargeable device s3 to select the charging position γ that minimizes its charging completion time 32 ,Right now Add mobile rechargeable device s3 to S 32 and update the idle time of the charging position
[0149] (4.4) Repeat step (4.3) to select charging positions for the mobile rechargeable devices in S′ in turn until the selection is completed. After the end, the charging position allocation scheme S is obtained. 11 ={s1}, S 12 ={s4}, S 21 ={s7}, S 22 ={s9, s5}, S 23 ={s8}, S 31 ={s6} and S 32 ={s3,s2}.
[0150] Furthermore, in this embodiment, the charging sequence of each mobile rechargeable device is further determined according to the charging allocation scheme to optimize the maximum return time of the device, including:
[0151] (5.1) For any charge position γ jk , c j ∈C, k∈{1, 2, … ρ j}, calculate the charging position γ jk Mobile rechargeable device subset S jk Mobile rechargeable devices i ∈S jk The arrival time, i.e. And sort them in non-decreasing order of the value to get the charge position γ jk The charging queue Ω jk , that is, Ω 11 ={s1},Ω 12 ={s4},Ω 21 ={s7},Ω 22 ={s5,s9},Ω23 ={s8},Ω 31 ={s6} and Ω 32 ={s2, s3};
[0152] (5.2) For any charge position γ jk , c j ∈C, k∈{1,2,…ρ j}, reinitialize the idle time of the charging position And initialize the charging sequence l=1;
[0153] (5.3) For any charge position γ jk The charging queue Ω jk , calculate the mobile rechargeable device s i ∈Ω jk The start time of charging and the return time are calculated, and the charging sequence and the idle time of the charging position are updated accordingly. 11 The charging queue Ω jk = {s1}, the charging start time of s7 is Return time is
[0154] (5.4) Repeat steps (5.2) and (5.3) until the charging sequence, charging start time and return time of all mobile rechargeable devices are obtained;
[0155] (5.5) Output charging scheme Includes the charging positions and charging sequence of all mobile rechargeable devices, and outputs the charging start time and return time of all mobile rechargeable devices. The charging start time of all mobile rechargeable devices is and The time of returning to work is T1=5.1h, T2=4.21h, T3=7.92h, T4=4.71h, T5=2.86h, T6=6.21h, T7=4.87h, T8=4.45h and T9=5.85h.
[0156] Example 2
[0157] Figure 5 This is a schematic diagram of the wireless charging scheduling system that minimizes the maximum return time. Figure 5 As shown, this embodiment provides a wireless charging scheduling system for minimizing the maximum return time, and the system includes:
[0158] Construction module 501, used to determine the return time of the mobile rechargeable device according to different departure times, movement times and charging times of the mobile rechargeable device, and to construct a maximum return time optimization model for the mobile rechargeable device;
[0159] A determination module 502, configured to determine a charging position allocation scheme for the mobile rechargeable devices according to a non-increasing order of departure times of the mobile rechargeable devices;
[0160] The optimization module 503 is used to determine the charging sequence of each mobile rechargeable device according to the charging allocation plan and the arrival time of the mobile rechargeable device to optimize the maximum return time.
[0161] Preferably, the construction module 501 determines the return time of the mobile rechargeable device according to different departure times, movement times and charging times of the mobile rechargeable device, including:
[0162] Mobile rechargeable devices i The return time is:
[0163]
[0164]
[0165]
[0166] in, For mobile rechargeable devices i Dispatch to charging position jk Charging time for charging, For mobile rechargeable devices i Move to charger c j The moving time of each charging position, Indicates the charging position γ jk The charging start time of the mobile rechargeable device with charging order l, E i For charging needs, P jk For mobile rechargeable devices in charging stations γ jk The charging power received at ij For mobile rechargeable devices i With charger c j The path length between each charging position, v i For mobile rechargeable devices i The moving speed, r i For mobile rechargeable devices i The departure time of the mobile rechargeable device is the lth in the charging queue, and the charging order l indicates that the mobile rechargeable device is in the lth position in the charging queue. jk (l) represents the charging position γ jk The above charging sequence is 1 for mobile rechargeable devices.
[0167] Preferably, the construction module 501 constructs a maximum return time optimization model for mobile rechargeable equipment, including:
[0168] Let the maximum return time T be the maximum time for the mobile rechargeable devices in the set S to return to their original positions, that is
[0169]
[0170] The problem of minimizing the maximum return time of mobile rechargeable equipment is constructed and formalized as follows:
[0171] min T
[0172]
[0173]
[0174]
[0175]
[0176] Among them, ω jk (l) = s i ; Each charger c j ∈C has ρ j charging positions, S represents the set of mobile rechargeable devices, C represents the set of static chargers, S jk Indicates that the charging position is γ jk A subset of mobile rechargeable devices that are charged at Indicates the size of the set, x ijkl =1 means moving the rechargeable device s i Dispatch to charging position jk The charging sequence is l, otherwise, let x ijkl =0; is the remaining power, For mobile rechargeable devices i ∈S battery capacity, For mobile rechargeable devices i Move to charger c j The mobile energy consumption of each charging position.
[0177] The specific implementation process of the functions realized by each module in this embodiment 2 is the same as the implementation process of each step in embodiment 1, and will not be repeated here.
[0178] Example 3
[0179] This embodiment provides an electronic device, which includes: a processor and a memory, wherein the memory stores computer-executable instructions, and when the computer-executable instructions are executed by the processor, the method steps in Embodiment 1 are implemented.
[0180] The specific implementation process can refer to the implementation process of the method steps in Example 1, which will not be repeated here.
[0181] Example 4
[0182] This embodiment provides a computer-readable storage medium, which stores computer-executable instructions. When the computer-executable instructions are executed by a processor, the method steps in Embodiment 1 are implemented.
[0183] The specific implementation process can refer to the implementation process of the method steps in Example 1, which will not be repeated here.
[0184] It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of the processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0185] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0186] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0187] The above description is only a preferred embodiment of the present invention, and does not limit the patent scope of the present invention. All equivalent structural changes made by using the contents of the present invention specification and drawings under the concept of the present invention, or directly / indirectly applied in other related technical fields are included in the patent protection scope of the present invention.
Claims
1. A wireless charging scheduling method for minimizing the maximum return time, characterized in that: The method comprises the following steps: Determine the return time of the mobile rechargeable device according to its different departure time, moving time and charging time, and build a maximum return time optimization model for the mobile rechargeable device; Determine a charging position allocation scheme for the mobile rechargeable devices according to the non-increasing order of the departure time of the mobile rechargeable devices; determine the charging order of each mobile rechargeable device according to the arrival time of the mobile rechargeable devices according to the charging position allocation scheme to optimize the maximum return time; the determining the return time of the mobile rechargeable devices according to the different departure times, movement times and charging times of the mobile rechargeable devices includes: Mobile rechargeable devices i The return time is: in, For mobile rechargeable devices i Dispatch to charging position jk Charging time for charging, For mobile rechargeable devices i Move to charger c j The moving time of each charging position, Indicates the charging position γ jk The charging start time of the mobile rechargeable device with charging order l, E i For charging needs, P ik For mobile rechargeable devices in charging stations γ jk The charging power received at ij For mobile rechargeable devices i With charger c j The path length between each charging position, v i For mobile rechargeable devices i The moving speed, r i For mobile rechargeable devices i The departure time of the mobile rechargeable device is the lth in the charging queue, and the charging order l indicates that the mobile rechargeable device is in the lth position in the charging queue. jk (l) represents the charging position γ jk A mobile rechargeable device with a charging order of l; the construction of a maximum return time optimization model for mobile rechargeable devices includes: Let the maximum return time T be the maximum time for the mobile rechargeable devices in the set S to return to their original positions, that is The problem of minimizing the maximum return time of mobile rechargeable equipment is constructed and formalized as follows: Among them, ω jk (l) = s i ; Each charger c j ∈C has ρ j charging positions, S represents the set of mobile rechargeable devices, C represents the set of static chargers, S jk Indicates that the charging position is γ jk The subset of mobile rechargeable devices that are charged at the location where the operator | | indicates the size of the set, x ijkl =1 means moving the rechargeable device s i Dispatch to charging position jk The charging sequence is l, otherwise, let x ijkl =0; is the remaining power, For mobile rechargeable devices i ∈S battery capacity, For mobile rechargeable devices i Move to charger c j The mobile energy consumption of each charging position of the mobile rechargeable device; the charging position allocation scheme of the mobile rechargeable device is determined according to the non-increasing order of the departure time of the mobile rechargeable device, including: (4.1) For each charging position γ jk , c j ∈C,k∈{1,2,...ρ j }, initialize the charging position γ jk A subset of mobile rechargeable devices Initialize charging position jk Charging queue for mobile rechargeable devices Initialize charging position jk Free time (4.2) Sort the mobile rechargeable devices in non-increasing order according to their departure time to obtain a mobile rechargeable device sequence S′; (4.3) According to the obtained device sequence S′, each mobile rechargeable device s in S′ is i Select the charging position that minimizes the current charging completion time, that is, Move rechargeable devices i Join Charging Station jk Mobile rechargeable device subset S jk and update the idle time of the charging position: (4.4) Repeat step (4.3) until charging positions are selected for all mobile rechargeable devices; the step of determining the charging order of each mobile rechargeable device according to the arrival time of the mobile rechargeable device according to the charging allocation scheme to optimize the maximum return time includes: (5.1) For any charge position γ jk , c j ∈C, k∈{1, 2, … ρ j }, calculate the charging position γ jk The device subset S jk Mobile rechargeable devices i ∈S jk The arrival time, i.e. And sort them in non-decreasing order of the value to get the charge position γ jk The charging queue Ω jk ; (5.2) For any charge position γ jk , reinitialize the idle time of the charging position And initialize the charging sequence l=1; (5.3) For any charge position γ jk The charging queue Ω jk , calculate each mobile rechargeable device s in turn i ∈Ω jk Start charging time: Counting mobile rechargeable devices i Return time: Update the charging sequence l=l+1 and update the idle time of the charging position (5.4) Repeat steps (5.2) and (5.3) until the charging sequence, charging start time and return time of all mobile rechargeable devices are obtained; (5.5) Output the charging plan Ω, including the charging positions and charging sequence of all mobile rechargeable devices, and output the charging start time and return time of all mobile rechargeable devices.
2. A wireless charging scheduling system that minimizes the maximum return time, characterized in that: The system comprises: A construction module is used to determine the return time of the mobile rechargeable device according to different departure times, movement times and charging times of the mobile rechargeable device, and to construct a maximum return time optimization model for the mobile rechargeable device; A determination module, used to determine a charging position allocation scheme for the mobile rechargeable device according to the non-increasing order of the departure time of the mobile rechargeable device; The optimization module is used to determine the charging order of each mobile rechargeable device according to the charging position allocation plan and the arrival time of the mobile rechargeable device to optimize the maximum return time; the construction module determines the return time of the mobile rechargeable device according to the different departure time, movement time and charging time of the mobile rechargeable device, including: Mobile rechargeable devices i The return time is: in, For mobile rechargeable devices i Dispatch to charging position jk Charging time for charging, For mobile rechargeable devices i Move to charger c j The moving time of each charging position, Indicates the charging position γ jk The charging start time of the mobile rechargeable device with charging order l, E i For charging needs, P jk For mobile rechargeable devices in charging stations γ jk The charging power received at ij For mobile rechargeable devices i With charger c j The path length between each charging position, v i For mobile rechargeable devices i The moving speed, r i For mobile rechargeable devices i The departure time of the mobile rechargeable device is the lth in the charging queue, and the charging order l indicates that the mobile rechargeable device is in the lth position in the charging queue. jk (l) represents the charging position γ jk The mobile rechargeable device with a charging order of l is constructed by the construction module to construct a maximum return time optimization model for the mobile rechargeable device, including: Let the maximum return time T be the maximum time for the mobile rechargeable devices in the set S to return to their original positions, that is The problem of minimizing the maximum return time of mobile rechargeable equipment is constructed and formalized as follows: Among them, ω jk (l) = s i ; Each charger c j ∈C has ρ j charging positions, S represents the set of mobile rechargeable devices, C represents the set of static chargers, S jk Indicates that the charging position is γ jk The subset of mobile rechargeable devices that are charged at the location where the operator | | indicates the size of the set, x ijkl =1 means moving the rechargeable device s i Dispatch to charging position jk The charging sequence is l, otherwise, let x ijkl =0; is the remaining power, For mobile rechargeable devices i ∈S battery capacity, For mobile rechargeable devices i Move to charger c j The mobile energy consumption of each charging position; Determining the charging position allocation scheme for the mobile rechargeable devices according to the non-increasing order of the departure time of the mobile rechargeable devices comprises: (4.1) For each charging position γ jk , c j ∈C,k∈{1,2,...ρ j }, initialize the charging position γ jk A subset of mobile rechargeable devices Initialize charging position jk Charging queue for mobile rechargeable devices Initialize charging position jk Free time (4.2) Sort the mobile rechargeable devices in non-increasing order according to their departure time to obtain a mobile rechargeable device sequence S′; (4.3) According to the obtained device sequence S′, each mobile rechargeable device s in S′ is i Select the charging position that minimizes the current charging completion time, that is, Move rechargeable devices i Join Charging Station jk Mobile rechargeable device subset S jk and update the idle time of the charging position: (4.4) Repeat step (4.3) until charging positions are selected for all mobile rechargeable devices; the step of determining the charging order of each mobile rechargeable device according to the arrival time of the mobile rechargeable device according to the charging allocation scheme to optimize the maximum return time includes: (5.1) For any charge position γ jk , c j ∈C,k∈{1,2,...ρ j }, calculate the charging position γ jk The device subset S jk Mobile rechargeable devices i ∈S jk The arrival time, i.e. And sort them in non-decreasing order of the value to get the charge position γ jk The charging queue Ω jk ; (5.2) For any charge position γ jk , reinitialize the idle time of the charging position And initialize the charging sequence l=1; (5.3) For any charge position γ jk The charging queue Ω jk , calculate each mobile rechargeable device s in turn i ∈Ω jk Start charging time: Counting mobile rechargeable devices i Return time: Update the charging sequence l=l+1 and update the idle time of the charging position (5.4) Repeat steps (5.2) and (5.3) until the charging sequence, charging start time and return time of all mobile rechargeable devices are obtained; (5.5) Output the charging plan Ω, including the charging positions and charging sequence of all mobile rechargeable devices, and output the charging start time and return time of all mobile rechargeable devices.
3. An electronic device, characterized in that: The electronic device comprises: a processor and a memory, wherein the memory stores computer executable instructions, and the computer executable instructions implement the method according to claim 1 when executed by the processor.
4. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, and when the computer-executable instructions are executed by a processor, the method according to claim 1 is implemented.
