| | | | | | | | ' also found in these entries (note: many are not synonyms or translations): Go to page and choose from different actions for taps or mouse clicks. | | | | | | | | Advertisements | | Advertisements | | | | | | use for the fastest search of WordReference. | © 2024 WordReference.com | any problems. | The State of the Developer Ecosystem report is out! Don't Miss Our Black Friday Sale:Get 50% Off All Products! Register for our upcoming webinar: Diversity in Tech: Strategies for Advancing Women & Non-Binary Individuals in TechWednesday | August 28, 2024 4pm IST - Skill-Based Assessments
- Online Assessment Proctoring
- Improved Candidate Experience
- Analytics for Technical Screening
- Smart Browser
AI-dentifying Your Top Tech TalentHire 1O(1) – How to Make Your Tech Hiring Process ResilientGuide to Pair Programming in Technical InterviewsPython DeveloperState of the Developer Ecosystem 2022-23Diversity in Tech: Strategies for Advancing Women & Non-Binary Individuals in Tech- Request a demo
- Assessments
- Learning and Development
- Internal Hackathons
- For Tech recruiters
- For Hiring Managers
- University Hiring
- Remote Hiring
- Code Compilation API
- People and Culture
HackerEarth GlossaryYour tech hr lexicon. - Reassignment --> Reassignment
ReassignmentWhat is reassignment. Reassignment refers to the process of moving an employee to a different position or role within the same organization. This can be a lateral move to a role of similar status and pay or a vertical move to a higher position. Reassignments can occur for various reasons, including organizational restructuring, employee skill development, or to address personal or performance-related issues. Key Features of Reassignment- Flexibility in Roles : Allows employees and organizations to adapt to changing needs and opportunities within the company.
- Skill Utilization and Development : Enables employees to apply their skills in new contexts or develop new skills.
- Retention Strategy : Can be used as a tool to retain valuable employees by offering them new challenges or fitting roles.
- Performance Management : May be part of a strategy to improve or realign employee performance.
How Does Reassignment Work?- Identification of Need : Recognizing the need for reassignment, either initiated by the employee or identified by management.
- Evaluation : Assessing the suitability of the employee for the new role, considering skills, experience, and performance.
- Discussion and Agreement : Discussing the potential reassignment with the employee, including expectations, responsibilities, and impact on salary or benefits.
- Implementation : Officially transferring the employee to the new role, which may include training or a transition period.
Best Practices for Managing Reassignment- Transparent Communication : Maintain open and honest communication with the employee about the reasons for and expectations of the reassignment.
- Support and Training : Provide necessary support and training to ensure a smooth transition and successful adaptation to the new role.
- Monitor and Evaluate : Follow up with the employee after the reassignment to assess adaptation to the new role and address any challenges.
- Fair Process : Ensure the reassignment process is fair and consistent, respecting the employee’s career goals and the organization’s needs.
Can an employee refuse a reassignment?Depending on the employment agreement and local laws, employees may have the right to refuse a reassignment, especially if it significantly alters their role, status, or compensation. How is reassignment different from a promotion?A promotion involves moving to a higher-level position, usually with increased responsibilities and pay. Reassignment can be lateral or vertical and may not always include a pay increase. Follow us onPopular terms - lockdown-browser
- training-needs-assessment
- psychometrics
Find out how HackerEarth can boost your tech recruiting. Top ResourcesHow to hireEssential reading for tech recruiters: tips and trends. Elevate your hiring game with our expert-led webinars Streamline your hiring process with OUR Hiring guides Access essential resources to enhance your tech recruitment Hiring ResourcesEmployee ReassignmentWhat Is Employee Reassignment?Reassignment vs promotion, what are the benefits of employee reassignment. - Reduce hiring. When the employee’s skills, work ethic and reputation align with company values , they make a good candidate for reassignment, reducing the need to hire new employees .
- Retain high-quality employees. Reassignment allows the company to keep exceptional employees even if their current job is no longer needed within the company.
- Reduce cost. A reassignment saves the company money and time because the company does not need to retrain or go through the onboarding process with a new employee.
- Morale booster. Reassigning an employee can send the message that the company cares and wants to invest time in their human capital.
Reasons to Reassign an Employee- Misaligned employee. This can happen when job responsibilities do not or no longer align with the current job description of the employee.
- Alternative position. If the company is eliminating a position, the company may reassign the employee to retain them.
- Sometimes employees can no longer perform the essential functions of their current position without accommodations . The reassignment could accommodate their change in performance capacity.
- This barrier may be formed when a leave of absence prevents the employer from holding a position for the entire leave period without incurring undue hardships.
- If location creates a work-related barrier that affects employee access or commute, a reassignment may be a great solution.
How to Manage Employee ReassignmentStep 1: meet with the supervisor, business executive and/or hr manager, step 2: meet with the employee, step 3: address issues with hr or the manager, step 4: communicate details. Eva (Keri) Tancredi Eddy’s HR Mavericks Encyclopedia - Eddy Overview
- People Management
- Time Tracking
- Training Tracking
- HR Encyclopedia
- HR Mavericks Podcast
- Help Center
- Contact Support
InformationInitiativesYou are accessing a machine-readable page. In order to be human-readable, please install an RSS reader. All articles published by MDPI are made immediately available worldwide under an open access license. No special permission is required to reuse all or part of the article published by MDPI, including figures and tables. For articles published under an open access Creative Common CC BY license, any part of the article may be reused without permission provided that the original article is clearly cited. For more information, please refer to https://www.mdpi.com/openaccess . Feature papers represent the most advanced research with significant potential for high impact in the field. A Feature Paper should be a substantial original Article that involves several techniques or approaches, provides an outlook for future research directions and describes possible research applications. Feature papers are submitted upon individual invitation or recommendation by the scientific editors and must receive positive feedback from the reviewers. Editor’s Choice articles are based on recommendations by the scientific editors of MDPI journals from around the world. Editors select a small number of articles recently published in the journal that they believe will be particularly interesting to readers, or important in the respective research area. The aim is to provide a snapshot of some of the most exciting work published in the various research areas of the journal. Original Submission Date Received: . - Active Journals
- Find a Journal
- Proceedings Series
- For Authors
- For Reviewers
- For Editors
- For Librarians
- For Publishers
- For Societies
- For Conference Organizers
- Open Access Policy
- Institutional Open Access Program
- Special Issues Guidelines
- Editorial Process
- Research and Publication Ethics
- Article Processing Charges
- Testimonials
- Preprints.org
- SciProfiles
- Encyclopedia
Article Menu- Subscribe SciFeed
- Recommended Articles
- Google Scholar
- on Google Scholar
- Table of Contents
Find support for a specific problem in the support section of our website. Please let us know what you think of our products and services. Visit our dedicated information section to learn more about MDPI. JSmol ViewerEnhancing unmanned aerial vehicle task assignment with the adaptive sampling-based task rationality review algorithm. 1. Introduction- Introducing task path decision variables and incorporating real-world constraints such as collaborative action constraints into the traditional model, improving the rigor and completeness of the task assignment mathematical model.
- Proposing an adaptive sampling strategy with dynamically adjusted sampling probabilities based on task importance, effectively avoiding the loss of high-value tasks due to low sampling probabilities, and ensuring a balance between computational efficiency and maximizing task value.
- Presenting a task review and classification method to address coherence issues in UAV task paths that are common in existing auction algorithms, significantly enhancing overall task benefits.
- Proposing a crossover path exchange strategy to reduce crossovers between UAV task paths, further optimizing the task assignment scheme and improving overall benefits.
2. Preliminary2.1. variable definitions, 2.2. symbol descriptions, 2.3. assumptions, 3. problem formulation, 3.1. decision variables, 3.2. objective function, 3.3. constraints, 3.4. mathematical model of task assignment, 4. algorithm and analysis, 4.1. basic idea and framework, 4.1.1. introduction of lsta. - Initialization stage : In the first stage, each UAV randomly samples the task set with a pre-set probability to form its own task sample set, followed by initializing the initial task sample set.
- Task assignment auction stage : In the second stage, UAVs calculate and rank the marginal gains [ 41 ] for the initial task sample set formed in the first stage. Through negotiation, the task with the highest marginal value and its corresponding UAV are selected, followed by conflict detection. Finally, global consensus and update are performed, adding the task with the highest marginal value to the corresponding UAV’s task set while removing the same task from the sample sets of other UAVs involved in the conflict detection.
4.1.2. Algorithm Overall Process- Initialization stage : We propose an adaptive sampling strategy that dynamically adjusts the sampling probability. This strategy increases the sampling probability for high-value tasks and decreases it for low-value tasks, minimizing the risk of missing high-value tasks due to a low sampling probability and reducing the benefit loss caused by probability adjustment.
- Task assignment auction stage : This stage follows the same process as that of the LSTA algorithm. During each iteration, tasks are auctioned and allocated to the UAV with the highest bid, and the same tasks are removed from the task sample sets of other UAVs. This iterative process continues, completing the initial allocation through repeated auctions.
- Task review and classification stage : We propose a task review and classification method for tasks that are unreasonably allocated during the auction stage. After the first round of auctions for all tasks, tasks are reviewed for coherence using heading change angles and flight distances as indicators. Tasks identified as having coherence issues in the UAV task sequence and tasks assigned to UAVs with underutilized load capacities are classified into two categories, creating a coherence issue task pool and a load-balanced task pool. These two pools undergo a new round of auctions independently, improving the quality of task allocation.
- Crossover path exchange stage : After the task review and classification stage, we introduce a crossover path exchange strategy. This strategy is inspired by the lazy-based review consensus algorithm (LRCA) [ 42 ] proposed by Xu et al. for vehicle task allocation and the crossover step in genetic algorithms. The maximum consensus strategy assigns the best task in each iteration to the UAV with the highest bid, which may cause intersections between UAV task paths. By adding a crossover path exchange strategy, the allocation results can be further optimized.
4.2. Adaptive Sampling Strategy Adaptive sampling strategy of the ASTRRA | , , T, , , , each task j in all task T probability is p |
4.3. Task Review and Classification Method Task review and classification method of the ASTRRA | , , , , each UAV’s in all len( ) each task m in the angle between and the length of and and or other combination conditions len( ) < L |
4.4. Crossover Path Exchange Strategy Cross-path exchange strategy of the ASTRRA. | , , , , each UAV’s in all each task m in each UAV’s in each task n in segment intersects segment the swapped paths do not exceed the maximum UAV’s payload |
5. Experiments and Analysis5.1. validation of effectiveness, 5.2. comparative analysis, 5.3. dynamic reassignment after damage, 6. conclusions, author contributions, institutional review board statement, informed consent statement, data availability statement, conflicts of interest. - Halder, S.; Ghosal, A.; Conti, M. Dynamic super round-based distributed task scheduling for UAV networks. IEEE Trans. Wirel. Commun. 2022 , 22 , 1014–1028. [ Google Scholar ] [ CrossRef ]
- Zhang, H. Offshore Oilfield Inspection Planning with Drone Routing Optimization. IEEE Access 2024 , 12 , 20885–20893. [ Google Scholar ] [ CrossRef ]
- Lee, H.W. Research on multi-functional logistics intelligent Unmanned Aerial Vehicle. Eng. Appl. Artif. Intell. 2022 , 116 , 105341. [ Google Scholar ] [ CrossRef ]
- Cao, P.; Lei, L.; Cai, S.; Shen, G.; Liu, X.; Wang, X.; Zhang, L.; Zhou, L.; Guizani, M. Computational Intelligence Algorithms for UAV Swarm Networking and Collaboration: A Comprehensive Survey and Future Directions. IEEE Commun. Surv. Tutor. 2024 , 1. [ Google Scholar ] [ CrossRef ]
- Shah, I.A.; Jhanjhi, N.Z.; Ujjan, R.M.A. Drone Technology in the Context of the Internet of Things. In Cybersecurity Issues and Challenges in the Drone Industry ; IGI Global: Hershey, PA, USA, 2024; pp. 88–107. [ Google Scholar ]
- Li, K.; Yan, X.; Han, Y. Multi-mechanism swarm optimization for multi-UAV task assignment and path planning in transmission line inspection under multi-wind field. Appl. Soft Comput. 2024 , 150 , 111033. [ Google Scholar ] [ CrossRef ]
- Yu, X.; Gao, X.; Wang, L.; Wang, X.; Ding, Y.; Lu, C.; Zhang, S. Cooperative multi-UAV task assignment in cross-regional joint operations considering ammunition inventory. Drones 2022 , 6 , 77. [ Google Scholar ] [ CrossRef ]
- Song, J.; Zhao, K.; Liu, Y. Survey on mission planning of multiple unmanned aerial vehicles. Aerospace 2023 , 10 , 208. [ Google Scholar ] [ CrossRef ]
- Deng, M.; Yao, Z.; Li, X.; Wang, H.; Nallanathan, A.; Zhang, Z. Dynamic multi-objective AWPSO in DT-assisted UAV cooperative task assignment. IEEE J. Sel. Areas Commun. 2023 , 41 , 3444–3460. [ Google Scholar ] [ CrossRef ]
- Chen, Y.; Yang, D.; Yu, J. Multi-UAV task assignment with parameter and time-sensitive uncertainties using modified two-part wolf pack search algorithm. IEEE Trans. Aerosp. Electron. Syst. 2018 , 54 , 2853–2872. [ Google Scholar ] [ CrossRef ]
- Tang, J.; Liu, D.; Wang, Q.; Li, J.; Sun, J. Probabilistic Chain-Enhanced Parallel Genetic Algorithm for UAV Reconnaissance Task Assignment. Drones 2024 , 8 , 213. [ Google Scholar ] [ CrossRef ]
- Redmond, D.; Soulier, M.; Droge, G. A Comparison of Many Approaches to Solving the Multiple Traveling Salesman Problem. In Proceedings of the 2024 Intermountain Engineering, Technology and Computing (IETC), Logan, UT, USA, 13–14 May 2024; IEEE: Piscataway, NJ, USA, 2024; pp. 180–185. [ Google Scholar ]
- Bai, X.; Fielbaum, A.; Kronmüller, M.; Knoedler, L.; Alonso-Mora, J. Group-based distributed auction algorithms for multi-robot task assignment. IEEE Trans. Autom. Sci. Eng. 2022 , 20 , 1292–1303. [ Google Scholar ] [ CrossRef ]
- Li, J.; Yang, X.; Yang, Y.; Liu, X. Cooperative mapping task assignment of heterogeneous multi-UAV using an improved genetic algorithm. Knowl.-Based Syst. 2024 , 296 , 111830. [ Google Scholar ] [ CrossRef ]
- Rong, L.; Ziyang, Z.; Liang, L.; Jiafeng, L. Research on Real-Time Target Assignment of UAV Swarm Based on DA-PSO Algorithm. In Proceedings of the 2021 5th Chinese Conference on Swarm Intelligence and Cooperative Control, Shenzhen, China, 19–22 January 2022; Springer: Berlin/Heidelberg, Germany, 2022; pp. 1740–1749. [ Google Scholar ]
- Wang, Y.; Shi, Y.; Liu, Y. Research on improved genetic simulated annealing algorithm for multi-UAV cooperative task allocation. J. Phys. Conf. Ser. 2022 , 2246 , 012081. [ Google Scholar ] [ CrossRef ]
- Bao, K.; Pan, J.; Zhu, J. Enhanced grey wolf optimization algorithm for group decision making in unmanned clusters. In Proceedings of the 2020 3rd International Conference on Unmanned Systems (ICUS), Harbin, China, 27–28 November 2020; IEEE: Piscataway, NJ, USA, 2020; pp. 523–527. [ Google Scholar ]
- Hooshyar, M.; Huang, Y.M. Meta-heuristic algorithms in UAV path planning optimization: A systematic review (2018–2022). Drones 2023 , 7 , 687. [ Google Scholar ] [ CrossRef ]
- Xu, S.; Bi, W.; Zhang, A.; Mao, Z. Optimization of flight test tasks allocation and sequencing using genetic algorithm. Appl. Soft Comput. 2022 , 115 , 108241. [ Google Scholar ] [ CrossRef ]
- Teck, S.; Dewil, R.; Vansteenwegen, P. A simulation-based genetic algorithm for a semi-automated warehouse scheduling problem with processing time variability. Appl. Soft Comput. 2024 , 160 , 111713. [ Google Scholar ] [ CrossRef ]
- Yafei, W.; Liang, Z. Improved Multi-objective Particle Swarm Optimization Algorithm based on Area Division with Application in Multi-UAV Task Assignment. IEEE Access 2023 , 11 , 123519–123530. [ Google Scholar ] [ CrossRef ]
- Geng, N.; Chen, Z.; Nguyen, Q.A.; Gong, D. Particle swarm optimization algorithm for the optimization of rescue task allocation with uncertain time constraints. Complex Intell. Syst. 2021 , 7 , 873–890. [ Google Scholar ] [ CrossRef ]
- Zhu, F.; Li, G.; Tang, H.; Li, Y.; Lv, X.; Wang, X. Dung beetle optimization algorithm based on quantum computing and multi-strategy fusion for solving engineering problems. Expert Syst. Appl. 2024 , 236 , 121219. [ Google Scholar ] [ CrossRef ]
- Sun, L.; Liang, H.; Ding, W.; Xu, J.; Chang, B. CMEFS: Chaotic mapping-based mayfly optimization with fuzzy entropy for feature selection. Appl. Intell. 2024 , 54 , 7397–7417. [ Google Scholar ] [ CrossRef ]
- Zhang, J.; Zhu, Y.; Wang, T.; Wang, W.; Wang, R.; Li, X. An Improved Intelligent Auction Mechanism for Emergency Material Delivery. Mathematics 2022 , 10 , 2184. [ Google Scholar ] [ CrossRef ]
- Wang, G.; Wang, F.; Wang, J.; Li, M.; Gai, L.; Xu, D. Collaborative target assignment problem for large-scale UAV swarm based on two-stage greedy auction algorithm. Aerosp. Sci. Technol. 2024 , 149 , 109146. [ Google Scholar ] [ CrossRef ]
- Zheng, X.; Zhang, F.; Song, T.; Lin, D. Heterogeneous multi-UAV distributed task allocation based on CBBA. In Proceedings of the 2019 IEEE International Conference on Unmanned Systems (ICUS), Beijing, China, 17–19 October 2019; IEEE: Piscataway, NJ, USA, 2019; pp. 704–709. [ Google Scholar ]
- Otte, M.; Kuhlman, M.J.; Sofge, D. Auctions for multi-robot task allocation in communication limited environments. Auton. Robot. 2020 , 44 , 547–584. [ Google Scholar ] [ CrossRef ]
- Nunes, E.; Gini, M. Multi-robot auctions for allocation of tasks with temporal constraints. In Proceedings of the AAAI Conference on Artificial Intelligence, Austin, TX, USA, 25–30 January 2015; Volume 29. [ Google Scholar ]
- Choi, H.L.; Brunet, L.; How, J.P. Consensus-based decentralized auctions for robust task allocation. IEEE Trans. Robot. 2009 , 25 , 912–926. [ Google Scholar ] [ CrossRef ]
- Zhang, S.; Liao, M.; Yang, C.; Chen, W. Redistribution Algorithm Based on Improved CBBA UAV Task Sequence. In Proceedings of the 2023 IEEE International Conference on Unmanned Systems (ICUS), Hefei, China, 13–15 October 2023; IEEE: Piscataway, NJ, USA, 2023; pp. 1–6. [ Google Scholar ]
- Shin, H.S.; Li, T.; Lee, H.I.; Tsourdos, A. Sample greedy based task allocation for multiple robot systems. Swarm Intell. 2022 , 16 , 233–260. [ Google Scholar ] [ CrossRef ]
- Wang, W.; Ru, L.; Lu, B.; Hu, S. Multi-task cooperative assignment of two-stage heterogeneous multi-UAV based on improved CBBA. In Proceedings of the 2023 3rd International Symposium on Computer Technology and Information Science (ISCTIS), Chengdu, China, 7–9 July 2023; IEEE: Piscataway, NJ, USA, 2023; pp. 173–178. [ Google Scholar ]
- Cao, Y.; Li, J.; Liu, L.; Liu, X.; Song, J.; Deng, S. MAV/UAV Formation Multi-Task Assignment Based on Distributed Auction Algorithm. In Proceedings of the 2023 IEEE International Conference on Unmanned Systems (ICUS), Hefei, China, 13–15 October 2023; IEEE: Piscataway, NJ, USA, 2023; pp. 223–233. [ Google Scholar ]
- Yan, S.; Xia, Y. Research on Collaborative Task Allocation of Heterogeneous UAVs with Complex Constraints. IEEE Access 2023 , 11 , 112451–112469. [ Google Scholar ] [ CrossRef ]
- Kim, K.S.; Kim, H.Y.; Choi, H.L. A bid-based grouping method for communication-efficient decentralized multi-UAV task allocation. Int. J. Aeronaut. Space Sci. 2020 , 21 , 290–302. [ Google Scholar ] [ CrossRef ]
- Cui, W.; Li, R.; Feng, Y.; Yang, Y. Distributed task allocation for a multi-UAV system with time window constraints. Drones 2022 , 6 , 226. [ Google Scholar ] [ CrossRef ]
- Xu, J.; Chen, C.; Chen, S.; Liu, Q. Distributed Task Assignment Method for Multiple Robots Based on Dynamic Auction Rules. In Proceedings of the 2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE), Dongguan, China, 28 February–2 March 2025; IEEE: Piscataway, NJ, USA, 2023; pp. 707–712. [ Google Scholar ]
- Buckman, N.; Choi, H.L.; How, J.P. Partial replanning for decentralized dynamic task allocation. In Proceedings of the AIAA Scitech 2019 Forum, San Diego, CA, USA, 7–11 January 2019; p. 0915. [ Google Scholar ]
- Li, T.; Shin, H.S.; Tsourdos, A. Efficient decentralized task allocation for UAV swarms in multi-target surveillance missions. In Proceedings of the 2019 International Conference on Unmanned Aircraft Systems (ICUAS), Atlanta, GA, USA, 1–14 June 2019; IEEE: Piscataway, NJ, USA, 2019; pp. 61–68. [ Google Scholar ]
- Feldman, M.; Harshaw, C.; Karbasi, A. Greed is good: Near-optimal submodular maximization via greedy optimization. In Proceedings of the Conference on Learning Theory, Amsterdam, The Netherlands, 7–10 July 2017; PMLR: London, UK, 2017; pp. 758–784. [ Google Scholar ]
- Xu, G.; Kang, X.; Yang, H.; Wu, Y.; Liu, W.; Cao, J.; Liu, Y. Distributed Multi-Vehicle Task Assignment and Motion Planning in Dense Environments. IEEE Trans. Autom. Sci. Eng. 2023 , 1–13. [ Google Scholar ] [ CrossRef ]
Click here to enlarge figure Symbol | Description |
---|
M | Total number of UAVs | N | Total number of tasks | | Indicates whether UAV a performs task j | | Indicates whether UAV a flies from task i to task j | | Total number of tasks assigned to UAV a | | Distance from task point i to task point j | | Cumulative distance flown by UAV a to task j | | Average speed of UAV a | | Time consumed by UAV a to perform task j | | Cumulative time consumed by UAV a to reach task j | | Degree to which the benefit of task j is affected by the arrival time of UAVs | | Matching degree of UAV a to task j | | Importance level of task j | R | Total benefit value of the UAV task allocation result | | Number of times task j needs to be performed | | Maximum task load of UAV a | | Maximum flight range of UAV a | | Takeoff waiting time of UAV a | | Official start time of UAV cooperative action | | Maximum flight time of UAV a | Object | Attribute | Description |
---|
Map | Area Size | 5000 m × 5000 m | UAV | Number of UAVs | 20 | UAV base location | (2200, 2500) | Maximum load capacity | 3 | Speed | 60 km/h | Task | Number of Tasks | 50 | Task location | Randomly distributed within the map area | Time discount factor | 0.90 | Importance factor | 0.85 | Suitability factor | 0.75 | Task execution time | 6 s | ID | Coord (m) | ID | Coord (m) | ID | Coord (m) | ID | Coord (m) | ID | Coord (m) |
---|
0 | 5274, 3402 | 10 | 2930, 4886 | 20 | 1707, 2359 | 30 | 4257, 113 | 40 | 2478, 3845 | 1 | 3072, 240 | 11 | 3646, 1478 | 21 | 1270, 3716 | 31 | 499, 1735 | 41 | 5164, 266 | 2 | 4234, 2197 | 12 | 2432, 3229 | 22 | 1070, 4432 | 32 | 1382, 1421 | 42 | 2880, 537 | 3 | 3520, 3547 | 13 | 1383, 2171 | 23 | 3044, 4136 | 33 | 4713, 3274 | 43 | 948, 1178 | 4 | 1999, 2817 | 14 | 5124, 3083 | 24 | 2775, 991 | 34 | 5288, 4769 | 44 | 5129, 1601 | 5 | 3348, 3544 | 15 | 479, 1466 | 25 | 646, 3411 | 35 | 1106, 2078 | 45 | 526, 723 | 6 | 4970, 2472 | 16 | 1862, 1582 | 26 | 4229, 4725 | 36 | 3338, 1022 | 46 | 3197, 3681 | 7 | 3646, 2356 | 17 | 2461, 4327 | 27 | 5276, 2948 | 37 | 1854, 1722 | 47 | 3077, 1873 | 8 | 1835, 2032 | 18 | 4246, 2951 | 28 | 1709, 1278 | 38 | 4713, 4293 | 48 | 2306, 3394 | 9 | 4385, 3389 | 19 | 3345, 4883 | 29 | 1671, 2965 | 39 | 4081, 3251 | 49 | 3489, 4175 | Algorithm | UAV Task Path | Reward Value | Runtime (s) |
---|
LSTA | {4, 22}, {20, 15}, {8, 43}, {29, 25}, {12, 23, 19}, | 0.947711 | 0.027328 | {37, 30, 41}, {13, 31}, {48, 17, 38}, {16, 44}, {47, 11, 36}, | {35, 27}, {28, 14}, {32, 45}, {40, 10, 34}, {7, 2, 6}, | {21, 0}, {46, 49, 26}, {5, 9, 33}, {24, 42, 1}, {3, 39, 18} | ASTRRA | {8, 32, 45}, {29, 25}, {37, 43}, {13, 35, 31}, {12, 23, 26}, | 0.969324 | 0.047354 | {14, 0}, {48, 17}, {44, 41, 30}, {39, 18}, {47, 11, 36}, | {27}, {4, 21, 22}, {16, 28}, {40, 10, 19}, {7, 2, 6}, | {20, 15}, {46, 49, 34}, {5, 38}, {24, 42, 1}, {3, 9, 33} | Object | Attribute | Scenario 1 | Scenario 2 | Scenario 3 | Scenario 4 |
---|
Map | Area Size | 5000 m × 5000 m | UAV | Number of UAVs | 20 | 30 | 40 | 50 | UAV base location | Randomly select a point within the map area | Maximum load capacity | 3 | Speed | 60 km/h | Tasks | Number of Tasks | 50 | 80 | 100 | 130 | Task location | Randomly distributed within the map area | Time discount factor | 0.8 | Task importance factor | Randomly distributed within [0.8–0.9] | Suitability factor | Randomly distributed within [0.9–1] | Task execution time | Randomly distributed within [6–30] s | Scenarios | CBBA | DSTA | LSTA | LRCA | ASTRRA |
---|
20 UAVs—50 Tasks | 0.739779 | 0.827821 | 0.827821 | 0.819542 | | 30 UAVs—80 Tasks | 0.761244 | 0.863158 | 0.863158 | 0.848905 | | 40 UAVs—100 Tasks | 0.764791 | 0.876372 | 0.876372 | 0.867653 | | 50 UAVs—130 Tasks | 0.746481 | 0.866691 | 0.866691 | 0.854172 | | Scenarios | CBBA (s) | DSTA (s) | LSTA (s) | LRCA (s) | ASTRRA (s) |
---|
20 UAVs—50 Tasks | 2.927 | 0.261 | 0.029 | 0.051 | | 30 UAVs—80 Tasks | 13.425 | 0.930 | 0.068 | 0.137 | | 40 UAVs—100 Tasks | 35.747 | 1.973 | 0.116 | 0.252 | | 50 UAVs—130 Tasks | 89.874 | 3.998 | 0.203 | 0.474 | | Round | Damaged UAV | Remaining Task Count | Task Path after Reassignment | Runtime (s) |
---|
1 | UAV 3 | 35 | {43}, {25}, {45}, {23, 19}, {9}, {17}, | 0.012919 | {6, 41}, {39, 33, 0}, {11, 36}, {18, 14, 27}, | {21, 22}, {30}, {10}, {2, 44}, {31, 15}, | {46, 49}, {5, 26}, {24, 42, 1}, {3, 38, 34} | 2 | UAV 18 | 26 | {}, {}, {45, 1}, {23, 19}, {9, 0}, {}, {6, 41}, | 0.006938 | {39, 33, 30}, {36}, {18, 14, 27}, {22}, {42}, | {10}, {2, 44}, {31, 15}, {49}, {26}, {38, 34} | 3 | UAV 19 | 19 | {}, {}, {45, 1}, {19}, {14, 27}, {}, | 0.004029 | {44, 41, 30}, {9, 34}, {36}, {33, 0}, | {22}, {42}, {10}, {6}, {}, {38}, {26} | | The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
Share and CiteSun, C.; Yao, Y.; Zheng, E. Enhancing Unmanned Aerial Vehicle Task Assignment with the Adaptive Sampling-Based Task Rationality Review Algorithm. Drones 2024 , 8 , 422. https://doi.org/10.3390/drones8090422 Sun C, Yao Y, Zheng E. Enhancing Unmanned Aerial Vehicle Task Assignment with the Adaptive Sampling-Based Task Rationality Review Algorithm. Drones . 2024; 8(9):422. https://doi.org/10.3390/drones8090422 Sun, Cheng, Yuwen Yao, and Enhui Zheng. 2024. "Enhancing Unmanned Aerial Vehicle Task Assignment with the Adaptive Sampling-Based Task Rationality Review Algorithm" Drones 8, no. 9: 422. https://doi.org/10.3390/drones8090422 Article MetricsArticle access statistics, further information, mdpi initiatives, follow mdpi. Subscribe to receive issue release notifications and newsletters from MDPI journals |
IMAGES
COMMENTS
The meaning of REASSIGN is to assign (something or someone) again especially in a new or different way. How to use reassign in a sentence.
1 attorney answer. Generally, it means the case is being reassigned to a new judge. Look closely at the actually reassignment to tell what is actually being reassigned. It may also be that the case is being reassigned to a new division based on a number of possible facts (the amount at issue, the number of plaintiffs, the nature of the claim, etc.)
REASSIGNMENT definition: 1. a process, including medical operations, by which someone's body is changed to match their…. Learn more.
reassign: 1 v transfer somebody to a different position or location of work Synonyms: transfer Types: second transfer an employee to a different, temporary assignment exchange hand over one and receive another, approximately equivalent alternate exchange people temporarily to fulfill certain jobs and functions Type of: assign , delegate , ...
REASSIGNMENT meaning: 1. a process, including medical operations, by which someone's body is changed to match their…. Learn more.
Define reassignment. reassignment synonyms, reassignment pronunciation, reassignment translation, English dictionary definition of reassignment. tr.v. re·as·signed , re·as·sign·ing , re·as·signs 1. To assign to a new position, duty, or location: reassigned the ambassador to a new post. ... reassignment - assignment to a different duty .
REASSIGN meaning: 1. to give someone a different job or position: 2. to give a piece of work to a different person…. Learn more.
reassignment: 1 n assignment to a different duty Types: secondment the detachment of a person from their regular organization for temporary assignment elsewhere Type of: assignment , duty assignment a duty that you are assigned to perform (especially in the armed forces)
Definition of reassignment noun in Oxford Advanced Learner's Dictionary. Meaning, pronunciation, picture, example sentences, grammar, usage notes, synonyms and more.
Reassign definition: to move (personnel, resources, etc) to a new post, department, location, etc. See examples of REASSIGN used in a sentence.
Reassignment definition: The act of reassigning ; a second or subsequent assignment .
(a) In this section, reassignment means a permanent assignment to another SES position within the employing executive agency or military department. (See 5 U.S.C. 105 for a definition of "executive agency" and 5 U.S.C. 102 for a definition of "military department.")
the allocation or distribution of work or resources in a different way reassignment of staff duties her home feels spacious because of the clever reassignment of storage 2. appointment to a different post or role employees were offered reassignment or early retirement (count noun) an officer could request a reassignment
Define ASSIGNMENT/REASSIGNMENT. The District agrees that, throughout the term of this contract, whenever it has determined in good faith that the best interests of the District require the reassignment of the Administrator, the transfer shall be to a position equivalent in responsibility and comparable in required expertise.
To move (personnel, resources, etc) to a new post, department, location, etc.... Click for English pronunciations, examples sentences, video.
Definition of reassign verb in Oxford Advanced American Dictionary. Meaning, pronunciation, picture, example sentences, grammar, usage notes, synonyms and more.
REASSIGN definition: 1. to give someone a different job or position: 2. to give a piece of work to a different person…. Learn more.
Summary of Reassignment. This summary of reassignment covers the following topics: 1. Learning About Reassignment. The reassignment regulations give an agency extensive flexibility in reassigning an employee to a different position. This summary covers the procedures in the reassignment regulations. With this summary, employees, managers, union ...
What does the noun reassignment mean? There is one meaning in OED's entry for the noun reassignment. See 'Meaning & use' for definition, usage, and quotation evidence. See meaning & use. How common is the noun reassignment? About 0.5 occurrences per million words in modern written English . 1770: 0.014: 1780: 0.012: 1790: 0.01: 1800: 0.0033:
Remember that your relationship with these colleagues will evolve. Ask questions to understand expectations about deliverables and responsibilities, how the team communicates, and how you fit into the group, Federico says. Make sure you have a clear sense of how your new team defines success. Determine the reassignment's length.
reassignment - WordReference English dictionary, questions, discussion and forums. All Free.
Reassignment refers to the process of moving an employee to a different position or role within the same organization. This can be a lateral move to a role of similar status and pay or a vertical move to a higher position. Reassignments can occur for various reasons, including organizational restructuring, employee skill development, or to ...
This meeting will explain the reassignment and discuss changes to the job. It will address any conflict, work-related barriers and performance issues and set the expectations for the employee in the new assignment. Be prepared for some resistance if this is not a voluntary reassignment by the employee or already agreed upon with the supervisor.
This is challenging in rural and poor areas. To address this challenge, mobile outreach teams of healthcare workers visit a fixed set of remote sites to provide healthcare services. Because of dynamics in demand and supply, once-rational site-to-team assignment decisions can become far from optimal over time.
As the application areas of unmanned aerial vehicles (UAVs) continue to expand, the importance of UAV task allocation becomes increasingly evident. A highly effective and efficient UAV task assignment method can significantly enhance the quality of task completion. However, traditional heuristic algorithms often perform poorly in complex and dynamic environments, and existing auction-based ...