The platform will undergo maintenance on Sep 14 at about 9:30 AM EST and will be unavailable for approximately 1 hour.
AIAA Propulsion and Energy 2019 Forum 2019
DOI: 10.2514/6.2019-4151
|View full text |Cite
|
Sign up to set email alerts
|

Drone-Station Matching in Smart Cities through Hungarian Algorithm: Power Minimization and Management

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 22 publications
0
4
0
Order By: Relevance
“…To verify the effectiveness of the algorithm in this scenario, we conducted 500 episodes of tests on the MA-SAC algorithm in this environment and compared it with other (1) Initialize environment (2) Initialize critic network and actor network (3) Initialize max episodes, replay buffer, batch size (4) for episode ∈ [1, episodes] do (5) Reset environment (6) Get current state s i for each agent, i (7) for step ∈ [1, steps] do (8) Select actions a i for each agent v i (9) Get all agents next states s i ′ and rewards r i (10) Store < a i , s i , s i ′ , r i > to replay buffer D (11) if D size > B size then (12) Sample batch B from replay buffer D (13) for v i , where i � 1:N do (14) Update the critic network (15) Update the actor network (16) Update the target network according to formulas ( 15), ( 16) (17) end for (18) end if (19) end for (20) Figure 4 shows the dynamic assignment process of UAVs in the task area before training. At this time, none of the three UAVs has learned any strategy, so they are in an exploration state in the environment.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…To verify the effectiveness of the algorithm in this scenario, we conducted 500 episodes of tests on the MA-SAC algorithm in this environment and compared it with other (1) Initialize environment (2) Initialize critic network and actor network (3) Initialize max episodes, replay buffer, batch size (4) for episode ∈ [1, episodes] do (5) Reset environment (6) Get current state s i for each agent, i (7) for step ∈ [1, steps] do (8) Select actions a i for each agent v i (9) Get all agents next states s i ′ and rewards r i (10) Store < a i , s i , s i ′ , r i > to replay buffer D (11) if D size > B size then (12) Sample batch B from replay buffer D (13) for v i , where i � 1:N do (14) Update the critic network (15) Update the actor network (16) Update the target network according to formulas ( 15), ( 16) (17) end for (18) end if (19) end for (20) Figure 4 shows the dynamic assignment process of UAVs in the task area before training. At this time, none of the three UAVs has learned any strategy, so they are in an exploration state in the environment.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…Optimization methods include Hungarian algorithm [15,16], branch-and-bound method [17], and other commonly used integer linear programming methods. ese algorithms are only applicable to scenarios with simple tasks and small UAV scale.…”
Section: Task Assignment Algorithmmentioning
confidence: 99%
“…For monitoring complex environments, the Hungarian algorithm can efficiently allocate monitoring tasks to UAVs based on the monitoring efficiency of the UAVs and the importance of the monitoring areas, aiming to minimize the total monitoring time or cost [22].…”
Section: Hungarian Algorithmmentioning
confidence: 99%
“…Over the past recent years, autonomous aerial vehicles have been growingly drawing attention and broadening their spectrum of specifications [13][14][15][16] .…”
Section: Equipped Drones With Network Test Handset To Load the Networmentioning
confidence: 99%