The Experts below are selected from a list of 71406 Experts worldwide ranked by ideXlab platform
Huan Xu - One of the best experts on this subject based on the ideXlab platform.
-
Hierarchal Application of Receding Horizon Synthesis and Dynamic Allocation for UAVs Fighting Fires
IEEE Access, 2018Co-Authors: Joshua A. Shaffer, Estefany Carrillo, Huan XuAbstract:This paper explores the design of a high-level mission planner and controller for managing unmanned aerial vehicles (UAVs) fighting a wildfire through the utilization of reactive synthesis and Dynamic Allocation of the UAVs as resources for the fire. The contribution of this paper is a study on the hierarchal integration of reactive synthesis, used for assuring desired system design traits, and Dynamic Allocation, used for making heuristic-based decisions. Reactive synthesis provides a formal means of guaranteeing the UAVs' transition to areas of fire, refill of water, and land as defined by the linear temporal logic specifications. Dynamic Allocation coordinates the behavior of multiple UAVs through assignments to regions of fire based on a cost function that takes into consideration the fire locations relative to a UAV, distance to the domain edge, wind speed and direction, and the amount of suppressant already present. The use of receding horizons in the reactive synthesis formulation incorporates horizons defined only through spatial distance from a goal. Modifications to these horizon definitions guarantee that the scenario still maintains the overall realizability of the formal specifications after the inclusion of static obstacles. This paper shows the effectiveness of multiple UAV fleets in slowing down the progression of fires from reaching the domain edge through six fire scenarios. At last, our results and successful application demonstrate the utilization of reactive synthesis in larger task spaces and the implications of abstracting UAV transitions for use in formal methods.
Roy H Campbell - One of the best experts on this subject based on the ideXlab platform.
-
plasma shared memory Dynamic Allocation and bank conflict free access in gpus
International Conference on Parallel Processing, 2012Co-Authors: Reza Farivar, Roy H CampbellAbstract:In this paper we present a library for shared-memory Dynamic Allocation and bank-conflict free accesses for NVIDIA GPUs. The system allows an order of magnitude faster pointer chasing operations for small and medium sized arrays.
-
ICPP Workshops - Plasma: Shared Memory Dynamic Allocation and Bank-Conflict-Free Access in GPUs
2012 41st International Conference on Parallel Processing Workshops, 2012Co-Authors: Reza Farivar, Roy H CampbellAbstract:In this paper we present a library for shared-memory Dynamic Allocation and bank-conflict free accesses for NVIDIA GPUs. The system allows an order of magnitude faster pointer chasing operations for small and medium sized arrays.
Joshua A. Shaffer - One of the best experts on this subject based on the ideXlab platform.
-
Hierarchal Application of Receding Horizon Synthesis and Dynamic Allocation for UAVs Fighting Fires
IEEE Access, 2018Co-Authors: Joshua A. Shaffer, Estefany Carrillo, Huan XuAbstract:This paper explores the design of a high-level mission planner and controller for managing unmanned aerial vehicles (UAVs) fighting a wildfire through the utilization of reactive synthesis and Dynamic Allocation of the UAVs as resources for the fire. The contribution of this paper is a study on the hierarchal integration of reactive synthesis, used for assuring desired system design traits, and Dynamic Allocation, used for making heuristic-based decisions. Reactive synthesis provides a formal means of guaranteeing the UAVs' transition to areas of fire, refill of water, and land as defined by the linear temporal logic specifications. Dynamic Allocation coordinates the behavior of multiple UAVs through assignments to regions of fire based on a cost function that takes into consideration the fire locations relative to a UAV, distance to the domain edge, wind speed and direction, and the amount of suppressant already present. The use of receding horizons in the reactive synthesis formulation incorporates horizons defined only through spatial distance from a goal. Modifications to these horizon definitions guarantee that the scenario still maintains the overall realizability of the formal specifications after the inclusion of static obstacles. This paper shows the effectiveness of multiple UAV fleets in slowing down the progression of fires from reaching the domain edge through six fire scenarios. At last, our results and successful application demonstrate the utilization of reactive synthesis in larger task spaces and the implications of abstracting UAV transitions for use in formal methods.
Estefany Carrillo - One of the best experts on this subject based on the ideXlab platform.
-
CCTA - Receding Horizon Synthesis and Dynamic Allocation of UAVs to Fight Fires
2018 IEEE Conference on Control Technology and Applications (CCTA), 2018Co-Authors: Joshua Shaffer, Estefany CarrilloAbstract:This paper explores the design of a high-level mission planner and controller for managing UAVs fighting a wildfire through the utilization of reactive synthesis and Dynamic Allocation of the UAVs as resources to the fires. Reactive synthesis provides a formal means of guaranteeing the UAVs transition to areas of fire, refill on water, and emergency land as defined by linear temporal logic specifications. Dynamic Allocation coordinates the behavior of multiple UAVs through assignments to regions of fire based on a cost function that takes into effect the fire locations, fire intensities and other UAV locations. For six fire scenarios, this paper determines the minimum number of UAVs required to eliminate all fires and prevent the burning of more than a set amount of fuel (i.e. forestry or shrubbery). Lastly, our results and successful application expand discussion on the utilization of reactive synthesis in larger task spaces and the implications of abstracting UAV transitions for use in formal methods.
-
Hierarchal Application of Receding Horizon Synthesis and Dynamic Allocation for UAVs Fighting Fires
IEEE Access, 2018Co-Authors: Joshua A. Shaffer, Estefany Carrillo, Huan XuAbstract:This paper explores the design of a high-level mission planner and controller for managing unmanned aerial vehicles (UAVs) fighting a wildfire through the utilization of reactive synthesis and Dynamic Allocation of the UAVs as resources for the fire. The contribution of this paper is a study on the hierarchal integration of reactive synthesis, used for assuring desired system design traits, and Dynamic Allocation, used for making heuristic-based decisions. Reactive synthesis provides a formal means of guaranteeing the UAVs' transition to areas of fire, refill of water, and land as defined by the linear temporal logic specifications. Dynamic Allocation coordinates the behavior of multiple UAVs through assignments to regions of fire based on a cost function that takes into consideration the fire locations relative to a UAV, distance to the domain edge, wind speed and direction, and the amount of suppressant already present. The use of receding horizons in the reactive synthesis formulation incorporates horizons defined only through spatial distance from a goal. Modifications to these horizon definitions guarantee that the scenario still maintains the overall realizability of the formal specifications after the inclusion of static obstacles. This paper shows the effectiveness of multiple UAV fleets in slowing down the progression of fires from reaching the domain edge through six fire scenarios. At last, our results and successful application demonstrate the utilization of reactive synthesis in larger task spaces and the implications of abstracting UAV transitions for use in formal methods.
Reza Farivar - One of the best experts on this subject based on the ideXlab platform.
-
plasma shared memory Dynamic Allocation and bank conflict free access in gpus
International Conference on Parallel Processing, 2012Co-Authors: Reza Farivar, Roy H CampbellAbstract:In this paper we present a library for shared-memory Dynamic Allocation and bank-conflict free accesses for NVIDIA GPUs. The system allows an order of magnitude faster pointer chasing operations for small and medium sized arrays.
-
ICPP Workshops - Plasma: Shared Memory Dynamic Allocation and Bank-Conflict-Free Access in GPUs
2012 41st International Conference on Parallel Processing Workshops, 2012Co-Authors: Reza Farivar, Roy H CampbellAbstract:In this paper we present a library for shared-memory Dynamic Allocation and bank-conflict free accesses for NVIDIA GPUs. The system allows an order of magnitude faster pointer chasing operations for small and medium sized arrays.
