7 December 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
When earthquakes occur, solar-powered unmanned aerial vehicles (SUAVs), deployed as communication relay points, can construct a signal relay network to assist the ground mobile communication vehicles in resuming communication. Considering the urgency of disaster relief, a practical, accurate, and robust modeling method for multiple SUAVs deployments is vital. For this concern, this article first formalizes the deployment problem of multiple solar-powered UAVs in communication recovery by extending Group MultiRole Assignment (GMRA) (UGRA). In the second step, the success in this assignment process depends on the choice of the agent evaluation method. The evaluation benchmark in UGRA is SUAV path planning in a complex environment with uncertain subpaths and accumulative attitude errors. In response to this issue, we propose two innovative algorithms: 1) dynamic curve path-planning algorithm (DCPPA) and 2) greedy curved straight path-planning algorithm (GCSPPA). Moreover, with the time requirement in mind, one sufficient condition and one necessary condition are established to help the DCPPA achieve fast convergence. With these two novel agent evaluation algorithms, UGRA can rapidly deploy multiple SUAVs to establish a collaborative relay network within an acceptable time. Finally, simulation experiments at different scales are carried out to demonstrate the accuracy and effectiveness of the proposed solution.
14 December 2021 in IEEE Transactions on Computational Social Systems
The World Bank estimates that the number of refugees worldwide will reach 140 million by 2050 due to global warming and local wars. Considering the rapid increase in the number of refugees, an efficient and feasible assignment method is required for refugee resettlement. This article formalizes the refugee resettlement issue using the Environments-Classes, Agents, Roles, Groups, and Objects (E-CARGO) model. A novel solution is designed for Refugee reSettling (RS) by extending the Group MultiRole Assignment (GMRA), which applies the agent stability evaluation method as a feedback mechanism while optimally resettling refugees. With this proposed solution, decision-makers can swiftly resettle refugees from multiple suffering countries while appropriately ensuring host countries' benefit. Finally, large-scale simulation experiments based on the Python PuLP platform are carried out to demonstrate the practicability and robustness of the proposed solution. The simulation results provide a solid decision-making reference for the leaders of the world.
9 March 2022 in IEEE Transactions on Computational Social Systems
Group role assignment with cooperation and conflict factors (GRACCFs) is a creative social computing method for team establishment. It can maximize the new team's performance through role assignment considering potential cooperation or conflict factors among agents. However, this method has two bottlenecks in practical applications. First, in the scenario of establishing a new team from several existing teams, collecting the pertinent cooperation or conflict information encounters challenges. Second, GRACCF merely takes the CCFs as a part of the objective function for team performance, but this will underestimate the CCFs' impacts on the sustainable development of the team. This article tackles these issues by extending GRACCF from a new viewpoint. It first designs a KD45 logic algorithm based on the KD45 logic system, which can discover the implicit cognitive CCFs through logical inferences with closure calculations. Then, it proposes an original team evaluation method that can help decision-makers determine the weights of team performance and CCFs' impacts based on their demands. Large-scale simulation experiments indicate that the proposed solution is practicable and robust. The proposed method provides a solid decision-making reference for administrators when establishing a sustainable team.
5 January 2022 in IEEE Transactions on Computational Social Systems
Self-service spatiotemporal crowdsourcing (SSC), a booming variant of spatiotemporal crowdsourcing (SC), emerges because of the vigorous development of the mobile Internet. Unlike the conventional SCs, the particularity of self-service in SSC may lead to unfinished tasks at the end of the entire assignment process, making a one-time assignment scheme ineffective. SSC is essentially an adaptive collaboration (AC) problem that requires a dynamic assignment strategy for a higher task completion rate. This article tackles this issue by establishing a quasi group role assignment (QGRA) based on a typical SSC scenario, that is, the photographing to make money problem (PMMP). First, it sheds light on a novel role awareness method, which can effectively divide tasks to accelerate the solution while, to some extent, raising the task completion rate. Second, it specifies an agent satisfaction evaluation (ASE) method to quantify the relationship between task completion rate and workers’ satisfaction. This method aims at considerably ameliorating task completion rate. Last, it extends QGRA with a new AC algorithm, which can achieve AC of the workers while accomplishing the crowdsourcing task. Moreover, utilizing the ASE method can help decision-makers balance the task completion rate and the workers’ satisfaction. Large-scale simulation experiments based on the real crowdsourced datasets exemplify the robustness and practicability of the proposed solutions. This article contributes a new version of the group role assignment (GRA) model, that is, quasi GRA (QGRA), a creative formalization to solve the AC problem.
22 June 2022 in IEEE Transactions on Computational Social Systems
In the team allocation problem (TAP), eliminating team disparities aims at keeping an equilibrium of the resource or ability among teams for equality. For this concern, existing literature merely utilized the golden mean principle to eliminate team disparities from a static perspective. Few of them reasonably investigate the pros and cons of this principle from a computational perspective. Moreover, maintaining equilibrium is a dynamic process and requires dynamic adjustment, especially after considering team members’ self-efforts and adaptivity. With respect to the environments—classes, agents, roles, groups, and objects (E-CARGO) model and its role-based collaboration (RBC) methodology, this article formalizes and solves the TAP, i.e., revised group role assignment (GRA) problem, from both the individual and team’s perspective. Based on the revised GRA, this article provides novel insight into the effectiveness of dynamically maintaining equilibrium, which may help decision-makers be proactive in building more sustainable teams. Relevant large-scale simulation experiments are conducted in this article to verify the proposed method. This article reveals a social paradox: even though considering all about the team members’ self-efforts and adaptivity, equilibrium still seems inequitable. Conversely, pursuing equilibrium may bring the Matthew effect.
19 December 2024 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
In role-based collaboration (RBC) methodology, eliminating agent conflicts during the role assignment process is crucial for establishing a sustainable cooperative system. However, when agent resources are scarce, assignment strategies aimed at eliminating agent conflicts become infeasible. Consequently, there is a need to select the optimal assignment with a minimal number of agent conflicts, which is essentially a nonlinear bilevel optimization problem. To tackle this issue, we first design the group role assignment with minimized agent conflicts (GRAMAC) model to formalize this problem. It converts this problem into an extended integer linear programming (x-ILP) one and finds the optimal solution. Then, we prove that solving the GRAMAC model is an $\mathscr {NP} - \mathrm {complete}$ task. Moreover, we identify the sufficient and necessary condition under which the GRAMAC model has the optimal conflict-free solution. Finally, extensive experiments demonstrate that, compared to existing strategies, our proposed method reduces the number of agent conflicts by an average of approximately 30% while ensuring the group performance of the collaborative system.