subject:(coverage control)

University of Ottawa

1. Adepegba, Adekunle Akinpelu. Multi-Agent Area Coverage Control Using Reinforcement Learning Techniques .

Degree: 2016, University of Ottawa

► An area coverage control law in cooperation with reinforcement learning techniques is proposed for deploying multiple autonomous agents in a two-dimensional planar area. A scalar… (more)

▼ An area coverage control law in cooperation with reinforcement learning techniques is proposed for deploying multiple autonomous agents in a two-dimensional planar area. A scalar field characterizes the risk density in the area to be covered yielding nonuniform distribution of agents while providing optimal coverage. This problem has traditionally been addressed in the literature to date using locational optimization and gradient descent techniques, as well as proportional and proportional-derivative controllers. In most cases, agents' actuator energy required to drive them in optimal configurations in the workspace is not considered. Here the maximum coverage is achieved with minimum actuator energy required by each agent. Similar to existing coverage control techniques, the proposed algorithm takes into consideration time-varying risk density. These density functions represent the probability of an event occurring (e.g., the presence of an intruding target) at a certain location or point in the workspace indicating where the agents should be located. To this end, a coverage control algorithm using reinforcement learning that moves the team of mobile agents so as to provide optimal coverage given the density functions as they evolve over time is being proposed. Area coverage is modeled using Centroidal Voronoi Tessellation (CVT) governed by agents. Based on [1,2] and [3], the application of Centroidal Voronoi tessellation is extended to a dynamic changing harbour-like environment. The proposed multi-agent area coverage control law in conjunction with reinforcement learning techniques is implemented in a distributed manner whereby the multi-agent team only need to access information from adjacent agents while simultaneously providing dynamic target surveillance for single and multiple targets and feedback control of the environment. This distributed approach describes how automatic flocking behaviour of a team of mobile agents can be achieved by leveraging the geometrical properties of centroidal Voronoi tessellation in area coverage control while enabling multiple targets tracking without the need of consensus between individual agents. Agent deployment using a time-varying density model is being introduced which is a function of the position of some unknown targets in the environment. A nonlinear derivative of the error coverage function is formulated based on the single-integrator agent dynamics. The agent, aware of its local coverage control condition, learns a value function online while leveraging the same from its neighbours. Moreover, a novel computational adaptive optimal control methodology based on work by [4] is proposed that employs the approximate dynamic programming technique online to iteratively solve the algebraic Riccati equation with completely unknown system dynamics as a solution to linear quadratic regulator problem. Furthermore, an online tuning adaptive optimal control algorithm is implemented using an actor-critic neural network recursive least-squares solution framework. The work in…

Subjects/Keywords: Area Coverage; Coverage Control; Reinforcement Learning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Adepegba, A. A. (2016). Multi-Agent Area Coverage Control Using Reinforcement Learning Techniques . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/34584

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Adepegba, Adekunle Akinpelu. “Multi-Agent Area Coverage Control Using Reinforcement Learning Techniques .” 2016. Thesis, University of Ottawa. Accessed March 03, 2021. http://hdl.handle.net/10393/34584.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Adepegba, Adekunle Akinpelu. “Multi-Agent Area Coverage Control Using Reinforcement Learning Techniques .” 2016. Web. 03 Mar 2021.

Vancouver:

Adepegba AA. Multi-Agent Area Coverage Control Using Reinforcement Learning Techniques . [Internet] [Thesis]. University of Ottawa; 2016. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10393/34584.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Adepegba AA. Multi-Agent Area Coverage Control Using Reinforcement Learning Techniques . [Thesis]. University of Ottawa; 2016. Available from: http://hdl.handle.net/10393/34584

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of California – San Diego

2. Gandarillas, Victor. Singular Perturbation Method for Multiagent Coverage Control Using Time-Varying Density Functions.

Degree: Mechanical and Aerospace Engineering, 2018, University of California – San Diego

URL: http://www.escholarship.org/uc/item/2n63x4nc

► This paper presents a continuous-time coverage algorithm based on the singu- lar perturbations method. The algorithm generates a control for a network of autonomous agents.… (more)

Subjects/Keywords: Aerospace engineering; control; coverage; multiagent; singular perturbation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gandarillas, V. (2018). Singular Perturbation Method for Multiagent Coverage Control Using Time-Varying Density Functions. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/2n63x4nc

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gandarillas, Victor. “Singular Perturbation Method for Multiagent Coverage Control Using Time-Varying Density Functions.” 2018. Thesis, University of California – San Diego. Accessed March 03, 2021. http://www.escholarship.org/uc/item/2n63x4nc.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Gandarillas, Victor. “Singular Perturbation Method for Multiagent Coverage Control Using Time-Varying Density Functions.” 2018. Web. 03 Mar 2021.

Vancouver:

Gandarillas V. Singular Perturbation Method for Multiagent Coverage Control Using Time-Varying Density Functions. [Internet] [Thesis]. University of California – San Diego; 2018. [cited 2021 Mar 03]. Available from: http://www.escholarship.org/uc/item/2n63x4nc.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gandarillas V. Singular Perturbation Method for Multiagent Coverage Control Using Time-Varying Density Functions. [Thesis]. University of California – San Diego; 2018. Available from: http://www.escholarship.org/uc/item/2n63x4nc

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Georgia

3. Abbasi Doustvatan, Farshid. Coverage control for heterogeneous multi-agent systems.

Degree: 2017, University of Georgia

URL: http://hdl.handle.net/10724/36554

► In the present dissertation, a team-based coverage control is proposed that aims at deploying groups of agents to an environment with a probability distribution function… (more)

Subjects/Keywords: Multi-agent Systems; heterogeneous agents; coverage control; team-based coverage; Linear Parameter-varying Models; System Identification; Robust Control; Nonlinear Control

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Abbasi Doustvatan, F. (2017). Coverage control for heterogeneous multi-agent systems. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/36554

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Abbasi Doustvatan, Farshid. “Coverage control for heterogeneous multi-agent systems.” 2017. Thesis, University of Georgia. Accessed March 03, 2021. http://hdl.handle.net/10724/36554.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Abbasi Doustvatan, Farshid. “Coverage control for heterogeneous multi-agent systems.” 2017. Web. 03 Mar 2021.

Vancouver:

Abbasi Doustvatan F. Coverage control for heterogeneous multi-agent systems. [Internet] [Thesis]. University of Georgia; 2017. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10724/36554.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Abbasi Doustvatan F. Coverage control for heterogeneous multi-agent systems. [Thesis]. University of Georgia; 2017. Available from: http://hdl.handle.net/10724/36554

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Queens University

4. Vandermeulen, Isaac. Distributed Extremum-Seeking Control with Applications to High-Altitude Balloons .

Degree: Chemical Engineering, 2016, Queens University

URL: http://hdl.handle.net/1974/14819

► The real-time optimization of large-scale systems is a difficult problem due to the need for complex models involving uncertain parameters and the high computational cost… (more)

Subjects/Keywords: high-speed internet ; distributed control ; formation control ; coverage control ; extremum-seeking control ; adaptive control ; parameter estimation ; high-altitude balloons

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Vandermeulen, I. (2016). Distributed Extremum-Seeking Control with Applications to High-Altitude Balloons . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/14819

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Vandermeulen, Isaac. “Distributed Extremum-Seeking Control with Applications to High-Altitude Balloons .” 2016. Thesis, Queens University. Accessed March 03, 2021. http://hdl.handle.net/1974/14819.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Vandermeulen, Isaac. “Distributed Extremum-Seeking Control with Applications to High-Altitude Balloons .” 2016. Web. 03 Mar 2021.

Vancouver:

Vandermeulen I. Distributed Extremum-Seeking Control with Applications to High-Altitude Balloons . [Internet] [Thesis]. Queens University; 2016. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/1974/14819.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vandermeulen I. Distributed Extremum-Seeking Control with Applications to High-Altitude Balloons . [Thesis]. Queens University; 2016. Available from: http://hdl.handle.net/1974/14819

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rice University

5. Lee, Seoung Kyou. Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments.

Degree: PhD, Engineering, 2015, Rice University

URL: http://hdl.handle.net/1911/87809

► Many tasks, such as search and rescue, exploration and mapping, security and surveil- lance are suited for mobile robots. These tasks require the population to… (more)

▼ Many tasks, such as search and rescue, exploration and mapping, security and surveil- lance are suited for mobile robots. These tasks require the population to spread out over a large environment, where the sensing and communicating capacity of an individual robot might be too small to cover the entire environment. This thesis presents approaches for cooperative coverage tasks by large populations of robots to overcome the limitation of a single robot. Not only can a multi-robot system accomplish the coverage task far more efficiently than an individual robot, but also it is more reliable against individual hardware failure. This thesis investigates two different scenarios with respect to distributed multi-robot space coverage in an unknown environment: First, I consider the space coverage in un- bounded environments. This scenario takes care of robots searching or monitoring in an unlimited region, such as a forest or submarine sea floor. For efficient scanning, robots need to spread out sufficiently to cover a large area. At the same time, they have to be close to their neighbors to prevent network disconnection. In order to fulfill both requirements simultaneously, I present a cohesive configuration controller by combining existing flock- ing strategies with a boundary force algorithm and network sensing and mode switching method. By doing so, robots form a convex and cohesive configuration without any dis- connection. Moreover, they maintain this final configuration even while moving. Secondly, I study space coverage problem in bounded environments that pursues to build a robotic sensor network. In this scenario, I present an algorithm to construct a triangulation using multiple low-cost robots. The resulting triangulation approximately maps the geometric characteristics of its surrounding environment and produces a physical data structure that stores triangle information distributively. This physical data structure provides auxiliary data to robots and lets them accomplish the application’s goal using only local communications. In this thesis, I address one simple application for patrolling and one complex application for topological Voronoi tessellation and center computation. This work provides theoretical guarantees about the algorithm performance. I also provide numerous simulation and hardware experiment results using the model of low- cost platforms to validate the feasibility of presented methods. In both scenarios, robots successfully form desired configurations without the aid of centralized infrastructures. In addition, the group of robots maintains the connectivity while running the algorithms. Advisors/Committee Members: McLurkin, James D. (advisor), Kavraki, Lydia (committee member), Hicks, Illya (committee member), Fekete, Sándor (committee member).

Subjects/Keywords: Multi-Robot System; Coverage Control; Swarm Intelligence; Distributed Algorithm; Computational Geometry

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lee, S. K. (2015). Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/87809

Chicago Manual of Style (16^th Edition):

Lee, Seoung Kyou. “Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments.” 2015. Doctoral Dissertation, Rice University. Accessed March 03, 2021. http://hdl.handle.net/1911/87809.

MLA Handbook (7^th Edition):

Lee, Seoung Kyou. “Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments.” 2015. Web. 03 Mar 2021.

Vancouver:

Lee SK. Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments. [Internet] [Doctoral dissertation]. Rice University; 2015. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/1911/87809.

Council of Science Editors:

Lee SK. Distributed Space Coverage for Exploration, Localization, and Navigation in Unknown Environments. [Doctoral Dissertation]. Rice University; 2015. Available from: http://hdl.handle.net/1911/87809

Kansas State University

6. Bennett, Jeffrey D. Value of map sharing between multiple vehicles in the same field while using automated section control.

Degree: Master of Agribusiness, Department of Agricultural Economics, 2016, Kansas State University

URL: http://hdl.handle.net/2097/32507

► Large acreage farms and even moderate sized farms employing custom applicators and harvesters have multiple machines in the same field at the same time conducting… (more)

▼ Large acreage farms and even moderate sized farms employing custom applicators and harvesters have multiple machines in the same field at the same time conducting the same field operation. As a method to control input costs and minimize application overlap, these machines have been equipped with automatic section control (ASC). For nearly all these multiple-vehicle operations, over application is a concern especially for more irregularly shaped fields; however modern technology including automated guidance combined with automatic section control allow reduced doubling of input application including seeds, fertilizer, and spray. Automatic section control depends on coverage maps stored locally on each vehicle to determine whether or not to apply input products and up to now, there has not been a clear method to share these maps between vehicles in the same field. Without sharing coverage maps, an individual ASC planting unit only has location data where it has applied individually and no location data for where other planting units have applied seed in that same field. Automatic section control relies upon shared coverage maps to be continually updated between each planting unit and utilizes existing machine telematics infrastructure for map data sharing. Telematics utilizes a cloud computing platform and cellular connectivity which in rural areas is known to have limited service levels. Planting operations were simulated for two 16-row planters, each using two John Deere GreenStar3 2630 monitors, simulated GPS location data stream, electronic rate control units, and individual row unit clutches to have control at the finest granularity. Each simulated planting unit is equipped with automatic section control and telematics gateways to share coverage map data from the first planting unit to JDLink cloud infrastructure then out to the second. This study evaluates the impact that field size and shape have on using multiple ASC planters and coverage map sharing, and estimates seed cost savings from reducing over application because coverage maps are shared between planting units. The impact of sharing coverage maps with both planting units using field boundaries with automatic section control and without using field boundaries were evaluated. Guidance line headings were determined using AgLeader SMS’s mission planning feature to minimize the number of passes across each field based on the field boundary and implement width. Each field was run twice using parallel tracking, once each with and without coverage map sharing to observe the extent of over application. The field level data were then taken to examine a fictious 3,000 acre farming operation where the field level data was used as a partial composition of the farm operation. An embedded Microsoft Excel macro was used to create 8,008 different composition scenarios to determine farm level savings. The average farm savings was $58,909 per year. Additionally, using the 8,008 scenarios, time value of money was examined to determine the the minimum area required… Advisors/Committee Members: Terry Griffin.

Subjects/Keywords: Automated Section Control; Precision; Wireless Connectivity; Coverage Map Sharing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bennett, J. D. (2016). Value of map sharing between multiple vehicles in the same field while using automated section control. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/32507

Chicago Manual of Style (16^th Edition):

Bennett, Jeffrey D. “Value of map sharing between multiple vehicles in the same field while using automated section control.” 2016. Masters Thesis, Kansas State University. Accessed March 03, 2021. http://hdl.handle.net/2097/32507.

MLA Handbook (7^th Edition):

Bennett, Jeffrey D. “Value of map sharing between multiple vehicles in the same field while using automated section control.” 2016. Web. 03 Mar 2021.

Vancouver:

Bennett JD. Value of map sharing between multiple vehicles in the same field while using automated section control. [Internet] [Masters thesis]. Kansas State University; 2016. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/2097/32507.

Council of Science Editors:

Bennett JD. Value of map sharing between multiple vehicles in the same field while using automated section control. [Masters Thesis]. Kansas State University; 2016. Available from: http://hdl.handle.net/2097/32507

University of New South Wales

7. Yang, Xiaotian. Decentralized collision-free control of multiple robots in 2D and 3D spaces.

Degree: Electrical Engineering & Telecommunications, 2017, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/59751 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49508/SOURCE02?view=true

► Decentralized control of robots has attracted huge research interests. However, some of the research used impractical assumptions without collision avoidance. This thesis focuses on the… (more)

▼ Decentralized control of robots has attracted huge research interests. However, some of the research used impractical assumptions without collision avoidance. This thesis focuses on the collision-free control for multiple robots in complete coverage and search tasks in 2D and 3D areas. Algorithms are decentralized as robots have limited abilities. The areas are arbitrary unknown and all algorithms are mathematically proved.The thesis starts with the grid selection in complete coverage and search tasks. Grid patterns simplify the representation of the area and robots only need to move straightly between neighbor vertices. For a 100% complete 2D coverage, the equilateral triangular grid is proposed. For the complete coverage ignoring the boundary effect, the grid with the fewest vertices is calculated in every situation for both 2D and 3D areas. The second part is for the complete coverage in 2D and 3D areas using a robot network. A decentralized collision-free algorithm with the selected grid pattern above is presented driving robots to sections which are furthest from the reference point. The areas can be static or expanding and the algorithm is simulated in MATLAB. Thirdly, three grid-based decentralized random algorithms with collision avoidance are provided to search targets in 2D or 3D areas. The number of targets can be known or unknown. In the first algorithm, robots choose vacant neighbors randomly with priorities on unvisited vertices while the second one adds the repulsive force to disperse robots if robots have neighbors in the sensing range. In the third algorithm, robots use the breadth-first search algorithm to go to the nearest unvisited vertices through the grid if surrounded by visited vertices. The second search algorithm is verified on Pioneer 3-DX robots and the way to generate the formula to estimate the search time in a general situation is demonstrated. Algorithms are compared with five other algorithms in MATLAB to show their effectiveness. Advisors/Committee Members: Savkin, Andrey, Electrical Engineering & Telecommunications, Faculty of Engineering, UNSW, Eaton, Ray, Electrical Engineering & Telecommunications, Faculty of Engineering, UNSW.

Subjects/Keywords: Multiple robots; Decentralized control; Collision avoidance; Search; Coverage

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yang, X. (2017). Decentralized collision-free control of multiple robots in 2D and 3D spaces. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/59751 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49508/SOURCE02?view=true

Chicago Manual of Style (16^th Edition):

Yang, Xiaotian. “Decentralized collision-free control of multiple robots in 2D and 3D spaces.” 2017. Doctoral Dissertation, University of New South Wales. Accessed March 03, 2021. http://handle.unsw.edu.au/1959.4/59751 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49508/SOURCE02?view=true.

MLA Handbook (7^th Edition):

Yang, Xiaotian. “Decentralized collision-free control of multiple robots in 2D and 3D spaces.” 2017. Web. 03 Mar 2021.

Vancouver:

Yang X. Decentralized collision-free control of multiple robots in 2D and 3D spaces. [Internet] [Doctoral dissertation]. University of New South Wales; 2017. [cited 2021 Mar 03]. Available from: http://handle.unsw.edu.au/1959.4/59751 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49508/SOURCE02?view=true.

Council of Science Editors:

Yang X. Decentralized collision-free control of multiple robots in 2D and 3D spaces. [Doctoral Dissertation]. University of New South Wales; 2017. Available from: http://handle.unsw.edu.au/1959.4/59751 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:49508/SOURCE02?view=true

University of Texas – Austin

8. Salling, Jackson Lee. Control flow graph visualization and its application to coverage and fault localization in Python.

Degree: MSin Engineering, Electrical and Computer Engineering, 2015, University of Texas – Austin

URL: http://hdl.handle.net/2152/32311

► This report presents a software testing tool that creates visualizations of the Control Flow Graph (CFG) from Python source code. The CFG is a representation… (more)

▼ This report presents a software testing tool that creates visualizations of the Control Flow Graph (CFG) from Python source code. The CFG is a representation of a program that shows execution paths that may be taken by the machine. Similar techniques to the ones here could be applied to many other languages, but the CFGs in this tool are tailored to the Python language. As computers get faster, tools to help programmers be effective at work can become more complex and still give quick feedback, without causing an undue performance burden. This tool explores several approaches to giving feedback to developers through a visualization of the CFG. First, just the viewing of a CFG gives a different perspective on the code. A programmer could choose to juxtapose the CFG with complexity metrics during development, seeing increased complexity as graphs grow larger. Second, the tool implements a mechanism to provide code coverage to Python modules. This feature extends the visualization to show code coverage as a highlighted CFG. Test coverage requirements are calculated to check node, edge, edge-pair, and prime path coverage. From studying existing testing tools, it appears no existing tool for Python provides all these test coverage levels. Third, the tool provides an interface for adding custom highlighting of the CFG, used here to visualize fault localization. Seeing the most suspicious locations from fault localization techniques could be used to reduce debugging time. The results of running the tool on several popular Python packages, and on itself, show its performance is competitive with the most popular coverage tool when measuring branch coverage. It is slightly slower on statement cover- age alone, but much faster against an unoptimized version and a logic coverage tool. This report also presents ideas for extensions to the tool. Among them is to incorporate program repair using fault localization and mutation operators. Visualizing code as a CFG provides interesting ways to look at many software testing metrics. Advisors/Committee Members: Khurshid, Sarfraz (advisor), Julien, Christine (committee member).

Subjects/Keywords: Control flow graph; Coverage; Fault localization; Software testing; Visualization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Salling, J. L. (2015). Control flow graph visualization and its application to coverage and fault localization in Python. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/32311

Chicago Manual of Style (16^th Edition):

Salling, Jackson Lee. “Control flow graph visualization and its application to coverage and fault localization in Python.” 2015. Masters Thesis, University of Texas – Austin. Accessed March 03, 2021. http://hdl.handle.net/2152/32311.

MLA Handbook (7^th Edition):

Salling, Jackson Lee. “Control flow graph visualization and its application to coverage and fault localization in Python.” 2015. Web. 03 Mar 2021.

Vancouver:

Salling JL. Control flow graph visualization and its application to coverage and fault localization in Python. [Internet] [Masters thesis]. University of Texas – Austin; 2015. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/2152/32311.

Council of Science Editors:

Salling JL. Control flow graph visualization and its application to coverage and fault localization in Python. [Masters Thesis]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/32311

University of Oxford

9. Alasfoor, Deena. Exploring access to primary health care among diabetic patients in Oman.

Degree: PhD, 2020, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:c6b9e52b-e2d1-46fe-85ae-09fb4e22c148 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.820740

► Access is an essential and yet only vaguely understood component of Universal Health Coverage. In this thesis, my aim is to measure patients’ experiences of… (more)

▼ Access is an essential and yet only vaguely understood component of Universal Health Coverage. In this thesis, my aim is to measure patients’ experiences of access to healthcare in Oman and to understand how this access is associated with disease outcome and quality of life. Initially, I carried out a concept analysis of access to primary healthcare, in which I identified the attributes, antecedents and consequences of access, and then utilised these attributes to map items for a patient experience questionnaire, using existing tools. This questionnaire, which I named Access-31, was subsequently tested for face and content validity through focus groups and individual interviews before it was utilised to conduct a survey of diabetes-2 patients attending primary healthcare services in Oman. The survey involved the use of Access-31, a quality of life measure, glycated haemoglobin data (HbA1c) and socio-economic indicators for study participants. The domains of access are as follows: geographical access, access to information, organisational access, affordability, cultural acceptability and availability of services and medicines. The cross-sectional survey showed that 28.3% of the respondents reported having had at least one problem related to geographical access, while 83.2%, 61.2%, 4.9%, 35.7% and 47.8% respectively experienced at least one problem with access to information, organisational access, affordability, cultural acceptability and availability of services and medicines. The composite access score indicated that 6.0% of the participants reported no problems with access, 38.4% 1-3 problems, 39.6% 4-6 problems, and 15.9% more than six problems. Geographical access, organisational access, cultural acceptability and overall access were associated with self-reported quality of life (P-value < 0.01), and the odds ratio for the relationship between availability of services and medicines and HbA1c was 3.02 (P-value < 0.01), while for access overall this figure was 2.56 (P-value = 0.01). Access-31 is a promising tool that would appear to reward further testing as regards the measurement of accessibility in healthcare. Poor access to healthcare is associated with poor health outcomes, and policymakers in Oman are advised to investigate variations among governorates and to take appropriate action.

Subjects/Keywords: health systems; quality of life; universal health coverage; accessibility; diabetes control

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Alasfoor, D. (2020). Exploring access to primary health care among diabetic patients in Oman. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:c6b9e52b-e2d1-46fe-85ae-09fb4e22c148 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.820740

Chicago Manual of Style (16^th Edition):

Alasfoor, Deena. “Exploring access to primary health care among diabetic patients in Oman.” 2020. Doctoral Dissertation, University of Oxford. Accessed March 03, 2021. http://ora.ox.ac.uk/objects/uuid:c6b9e52b-e2d1-46fe-85ae-09fb4e22c148 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.820740.

MLA Handbook (7^th Edition):

Alasfoor, Deena. “Exploring access to primary health care among diabetic patients in Oman.” 2020. Web. 03 Mar 2021.

Vancouver:

Alasfoor D. Exploring access to primary health care among diabetic patients in Oman. [Internet] [Doctoral dissertation]. University of Oxford; 2020. [cited 2021 Mar 03]. Available from: http://ora.ox.ac.uk/objects/uuid:c6b9e52b-e2d1-46fe-85ae-09fb4e22c148 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.820740.

Council of Science Editors:

Alasfoor D. Exploring access to primary health care among diabetic patients in Oman. [Doctoral Dissertation]. University of Oxford; 2020. Available from: http://ora.ox.ac.uk/objects/uuid:c6b9e52b-e2d1-46fe-85ae-09fb4e22c148 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.820740

University of New South Wales

10. Nazarzehi Had, Vali Mohammad. Decentralized control of three dimensional mobile robotic sensor networks.

Degree: Electrical Engineering & Telecommunications, 2016, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/56534 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40945/SOURCE02?view=true

► Decentralised control of mobile robotic sensor networks is a fundamental problem in robotics that has attracted intensive research in recent decades. Most of the existing… (more)

▼ Decentralised control of mobile robotic sensor networks is a fundamental problem in robotics that has attracted intensive research in recent decades. Most of the existing works dealt with two-dimensional spaces. This thesis is concerned with the problem of decentralised self-deployment of mobile robotic sensor networks for coverage, search, and formation building in three-dimensional environments.The first part of the thesis investigates the problem of complete sensing coverage in three-dimensional spaces. We propose a decentralised random algorithm to drive mobile robotic sensors on the vertices of a truncated octahedral grid for complete sensing coverage of a bounded 3D area. Then, we develop a decentralised random algorithm for self-deployment of mobile robotic sensors to form a desired geometric shape on the vertices of the truncated octahedral grid. The second part of this thesis studies the problem of search in 3D spaces. We present a distributed random algorithm for search in bounded three dimensional environments. The proposed algorithm utilises an optimal three dimensional grid for the search task.Third, we study the problem of locating static and mobile targets in a bounded 3D space by a network of mobile robotic sensors. We introduce a novel decentralised bio-inspired random search algorithm for finding static and mobile objects in 3D areas. This algorithm combines the Levy flight random search mechanism with a 3D covering grid. Using this algorithm, the mobile robotic sensors randomly move on the vertices of the covering grid with the length of the movements follow a Levy flight distribution.This thesis studies the problem of 3D formation building in 3D spaces by a network of mobile robotic sensors. Decentralised consensus-based control law for the multi-robot system which results in forming a given geometric configuration from any initial positions in 3D environments is proposed. Then, a decentralised random motion coordination law for the multi-robot system for the case when the mobile robots are unaware of their positions in the configuration in three dimensional environments is presented. The proposed algorithms use some simple consensus rules for motion coordination and building desired geometric patterns. Convergence of the mobile robotic sensors to the given configurations is shown by extensive simulations. Moreover, a mathematically rigorous proof of convergence of the proposed algorithms to the given configurations are given. Advisors/Committee Members: V.Savkin, Andrey, Electrical Engineering & Telecommunications, Faculty of Engineering, UNSW.

Subjects/Keywords: Mobile robots; Decentralized control; Distributed control; Mobile sensor networks; Coverage; Formation building

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nazarzehi Had, V. M. (2016). Decentralized control of three dimensional mobile robotic sensor networks. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/56534 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40945/SOURCE02?view=true

Chicago Manual of Style (16^th Edition):

Nazarzehi Had, Vali Mohammad. “Decentralized control of three dimensional mobile robotic sensor networks.” 2016. Doctoral Dissertation, University of New South Wales. Accessed March 03, 2021. http://handle.unsw.edu.au/1959.4/56534 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40945/SOURCE02?view=true.

MLA Handbook (7^th Edition):

Nazarzehi Had, Vali Mohammad. “Decentralized control of three dimensional mobile robotic sensor networks.” 2016. Web. 03 Mar 2021.

Vancouver:

Nazarzehi Had VM. Decentralized control of three dimensional mobile robotic sensor networks. [Internet] [Doctoral dissertation]. University of New South Wales; 2016. [cited 2021 Mar 03]. Available from: http://handle.unsw.edu.au/1959.4/56534 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40945/SOURCE02?view=true.

Council of Science Editors:

Nazarzehi Had VM. Decentralized control of three dimensional mobile robotic sensor networks. [Doctoral Dissertation]. University of New South Wales; 2016. Available from: http://handle.unsw.edu.au/1959.4/56534 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40945/SOURCE02?view=true

University of Waterloo

11. Sadeghi Yengejeh, Armin. Multi-robot Coverage and Redeployment Algorithms.

Degree: 2020, University of Waterloo

URL: http://hdl.handle.net/10012/16370

► In this thesis, we focus on two classes of multi-robot task allocation and deployment problems motivated by applications in ride-sourcing transportation networks and service robots:… (more)

▼ In this thesis, we focus on two classes of multi-robot task allocation and deployment problems motivated by applications in ride-sourcing transportation networks and service robots: 1) coverage control with multiple robots, and 2) robots servicing tasks arriving sequentially over time. The first problem considers the deployment of multiple robots to cover a domain. The multi-robot problem consists of multiple robots with sensors on-board observing the spatially distributed events in an environment. The objective is to maximize the sensing quality of the events via optimally distributing the robots in the environment. This problem has been studied extensively in the literature and several algorithms have been proposed for different variants of this problem. However, there has been a lack of theoretical results on the quality of the solutions provided by these algorithms. In this thesis, we provide a new distributed multi-robot coverage algorithm with theoretical guarantees on the solution quality, run-time complexity, and communication complexity. The theoretical bound on the solution quality holds for on-board sensors where the sensing quality of the sensors is a sub-additive function of the distance to the event location in convex and non-convex environments. A natural extension of the multi-robot coverage control problem is considered in this thesis where each robot is equipped with a set of different sensors and observes different event types in the environment. Servicing a task in this problem corresponds to sensing an event occurring at a particular location and does not involve visiting the task location. Each event type has a different distribution over the domain. The robots are heterogeneous in that each robot is capable of sensing a subset of the event types. The objective is to deploy the robots into the domain to maximize the total coverage of the multiple event types. We propose a new formulation for the heterogeneous coverage problem. We provide a simple distributed algorithm to maximize the coverage. Then, we extend the result to the case where the event distribution is unknown before the deployment and provide a distributed algorithm and prove the convergence of the approach to a locally optimal solution. The third problem considers the deployment of a set of autonomous robots to efficiently service tasks that arrive sequentially in an environment over time. Each task is serviced when a robot visits the corresponding task location. Robots can then redeploy while waiting for the next task to arrive. The objective is to redeploy the robots taking into account the next N task arrivals. We seek to minimize a linear combination of the expected cost to service tasks and the redeployment cost between task arrivals. In the single robot case, we propose a one-stage greedy algorithm and prove its optimality. For multiple robots, the problem is NP-hard, and we propose two constant-factor approximation algorithms, one for the problem with a horizon of two task arrivals and the other for the infinite…

Subjects/Keywords: distributed control; multi-robot coverage control; mobility-on-demand systems; ride-sharing systems

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sadeghi Yengejeh, A. (2020). Multi-robot Coverage and Redeployment Algorithms. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16370

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Sadeghi Yengejeh, Armin. “Multi-robot Coverage and Redeployment Algorithms.” 2020. Thesis, University of Waterloo. Accessed March 03, 2021. http://hdl.handle.net/10012/16370.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Sadeghi Yengejeh, Armin. “Multi-robot Coverage and Redeployment Algorithms.” 2020. Web. 03 Mar 2021.

Vancouver:

Sadeghi Yengejeh A. Multi-robot Coverage and Redeployment Algorithms. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10012/16370.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sadeghi Yengejeh A. Multi-robot Coverage and Redeployment Algorithms. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16370

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

12. Diaz-Mercado, Yancy J. Interactions in multi-robot systems.

Degree: PhD, Electrical and Computer Engineering, 2016, Georgia Tech

URL: http://hdl.handle.net/1853/55020

► The objective of this research is to develop a framework for multi-robot coordination and control with emphasis on human-swarm and inter-agent interactions. We focus on… (more)

Subjects/Keywords: Multi-robot control; Human-swarm interactions; Coverage control; Coverage of time-varying density functions; Braids; Multi-robot mixing; Inter-robot interactions; Mixing limit; Symbolic motion planning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Diaz-Mercado, Y. J. (2016). Interactions in multi-robot systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55020

Chicago Manual of Style (16^th Edition):

Diaz-Mercado, Yancy J. “Interactions in multi-robot systems.” 2016. Doctoral Dissertation, Georgia Tech. Accessed March 03, 2021. http://hdl.handle.net/1853/55020.

MLA Handbook (7^th Edition):

Diaz-Mercado, Yancy J. “Interactions in multi-robot systems.” 2016. Web. 03 Mar 2021.

Vancouver:

Diaz-Mercado YJ. Interactions in multi-robot systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/1853/55020.

Council of Science Editors:

Diaz-Mercado YJ. Interactions in multi-robot systems. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/55020

13. Patel, Rushabh. Robotic Surveillance and Deployment Strategies.

Degree: 2015, University of California – eScholarship, University of California

URL: http://www.escholarship.org/uc/item/4h56w89t

► Autonomous mobile systems are becoming more common place, and have the opportunity to revolutionize many modern application areas. They include, but are not limited to,… (more)

▼ Autonomous mobile systems are becoming more common place, and have the opportunity to revolutionize many modern application areas. They include, but are not limited to, tasks such as search and rescue operations, ad-hoc mobile wireless networks and warehouse management; each application having its own complexities and challenging problems that need addressing. In this thesis, we explore and characterize two application areas in particular. First, we explore the problem of autonomous stochastic surveillance. In particular, we study random walks on a finite graph that are described by a Markov chain. We present strategies that minimize the first hitting time of the Markov chain, and look at both the single agent and multi-agent cases. In the single agent case, we provide a formulation and convex optimization scheme for the hitting time on graphs with travel distances. In addition, we provide detailed simulation results showing the effectiveness of our strategy versus other well-known Markov chain design strategies. In the multi-agent case, we provide the first characterization of the hitting time for multiple random walkers, which we denote the "group hitting time". We also provide a closed form solution for calculating the hitting time between specified nodes for both the single and multiple random walker cases. Our results allow for the multiple random walks to be different and, moreover, for the random walks to operate on different subgraphs. Finally, we use sequential quadratic programming to find the transition matrices that generate minimal "group hitting time".Second, we consider the problem of optimal coverage with a group of mobile agents. For a planar environment with an associated density function, this problem is equivalent to dividing the environment into optimal subregions such that each agent is responsible for the coverage of its own region. We study this problem for the discrete time and space case and the continuous time and space case. For the discrete time and space case, we present algorithms that provide optimal coverage control in a non-convex environment when each robot has only asynchronous and sporadic communication with a base station. We introduce the notion of coverings, a generalization of partitions, to do this. For the continuous time and space case, we present a continuous-time distributed policy which allows a team of agents to achieve a convex area-constrained partition in a convex workspace. This work is related to the classic Lloyd algorithm, and makes use of generalized Voronoi diagrams. For both cases we provide detailed simulation results and discuss practical implementation issues.

Subjects/Keywords: Mechanical engineering; Mathematics; Electrical engineering; Coverage control; Hitting time; Markov chains; Optimization; Robotics; Surveillance

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Patel, R. (2015). Robotic Surveillance and Deployment Strategies. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/4h56w89t

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Patel, Rushabh. “Robotic Surveillance and Deployment Strategies.” 2015. Thesis, University of California – eScholarship, University of California. Accessed March 03, 2021. http://www.escholarship.org/uc/item/4h56w89t.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Patel, Rushabh. “Robotic Surveillance and Deployment Strategies.” 2015. Web. 03 Mar 2021.

Vancouver:

Patel R. Robotic Surveillance and Deployment Strategies. [Internet] [Thesis]. University of California – eScholarship, University of California; 2015. [cited 2021 Mar 03]. Available from: http://www.escholarship.org/uc/item/4h56w89t.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Patel R. Robotic Surveillance and Deployment Strategies. [Thesis]. University of California – eScholarship, University of California; 2015. Available from: http://www.escholarship.org/uc/item/4h56w89t

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Mei, Jian. Distributed Coverage Control of Multi-Agent System in Convective–Diffusive Time Evolving Environments .

Degree: 2019, University of Ottawa

URL: http://hdl.handle.net/10393/39601

► Using multi-agent systems to execute a variety of missions such as environmental monitoring and target tracking has been made possible by the advances in control… (more)

▼ Using multi-agent systems to execute a variety of missions such as environmental monitoring and target tracking has been made possible by the advances in control techniques and computational capabilities. Communication abilities between agents allow them to coact and execute several coordinated missions, among which there is optimal coverage. The optimal coverage problem has several applications in engineering theory and practice, as for example in environmental monitoring, which belongs to the broad class of resource allocation problems, in which a ﬁnite number of mobile agents have to be deployed in a given spatial region with the assignment of a sub-region to each agents with respect to a suitable coverage metric. The coverage metric encodes the sensing performance of individual agent with respect to points inside the domain of interest, and a distribution of risk density. Usually the risk density function measures the relative importance assigned to inner regions. The optimal coverage problem in which the risk density is time-invariant has been widely studied in previous research. The solution to this class of problems is centroidal Voronoi tessellation, in which each agent is located on the centroid of the related Voronoi cell. However, there are many scenarios that require to be modelled by time-varying risk density rather than time-invariant one, as for example in area coverage problems where the environment evolves independently of the evolution for the robotic agents deployed to cover the area. In this work, the changing environment is modeled by a time-varying density function which is governed by a convection-diffusion equation. Mixed boundary conditions are considered to model a scenario in which a diffusive substance (e.g., oil from a leaking event or radioactive material from a nuclear accident) enters the area with convective component from the boundary. A non-autonomous feed- back law is employed whose generated trajectories maximize the coverage metric. The asymptotic stability of the multi-agent system is proven by using Barbalat’s lemma, and then theoretical predictions are illustrated by several simulations that represent idealized scenarios.

Subjects/Keywords: Coverage control; Wireless sensor network

…assignment, and area coverage control. [1]. Area coverage control is an application of… …x5B;4]. 1.1 Motivation Recently, the area coverage control with WSNs has received… …configuration of the extraction wells. The static area coverage control with stationary risk density… …function has been widely studied. Some studies formulated the coverage control problem with the… …thesis is motivated by previous research of optimizing the non-autonomous coverage control in…

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mei, J. (2019). Distributed Coverage Control of Multi-Agent System in Convective–Diffusive Time Evolving Environments . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/39601

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Mei, Jian. “Distributed Coverage Control of Multi-Agent System in Convective–Diffusive Time Evolving Environments .” 2019. Thesis, University of Ottawa. Accessed March 03, 2021. http://hdl.handle.net/10393/39601.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Mei, Jian. “Distributed Coverage Control of Multi-Agent System in Convective–Diffusive Time Evolving Environments .” 2019. Web. 03 Mar 2021.

Vancouver:

Mei J. Distributed Coverage Control of Multi-Agent System in Convective–Diffusive Time Evolving Environments . [Internet] [Thesis]. University of Ottawa; 2019. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10393/39601.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mei J. Distributed Coverage Control of Multi-Agent System in Convective–Diffusive Time Evolving Environments . [Thesis]. University of Ottawa; 2019. Available from: http://hdl.handle.net/10393/39601

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. Pham, Huy X. Design Distributed Control and Learning Algorithms for a Team of UAVs for Optimal Field Coverage.

Degree: 2018, University of Nevada – Reno

URL: http://hdl.handle.net/11714/4886

► Optimal field coverage problem refers to an active research branch that studies how we can use a finite set of sensors, such as camera, to… (more)

▼ Optimal field coverage problem refers to an active research branch that studies how we can use a finite set of sensors, such as camera, to optimally cover a field with arbitrary shape that can either be static or dynamically change over time. The problem arises in a wide range of applications, notably wildfires and oil spill tracking, military surveillance, and agriculture monitoring. In these applications, it is of growing interest to send a team of Unmanned Aerial Vehicles (UAVs) acting as a mobile sensor network, as they can provide sensing information with low costs and high flexibility, compared with traditional static monitoring methods. In this thesis, we addressed the problem by two distinct approaches: one is model-based and the other is model-free. In the first part, we proposed a model-based control framework for UAV teaming to monitor and track a dynamic field like wildfire spreading. Wildfire is well-known for their destructive ability to inflict massive damage and disruption. We characterized the optimal sensing coverage problem to work with a changing wildfire environment. We proposed a decentralized control algorithm for a team of UAVs that can autonomously and actively track the fire spreading boundary in a distributed manner. The UAV team can also effectively provide full coverage of the field and avoid in-flight collisions. Moreover, based on the proposed algorithm, some of the UAVs can automatically adjust their altitude to increase the image resolution of the border of the wildfire, while the whole team tries to maintain a complete view of it. In the second part, we utilized a model-free learning algorithm to solve a problem of optimal coverage for a static field of arbitrary shape. The objective of the UAV team is not only to fully cover the field of interest, but also to minimize overlapping among field of views of the UAVs to increase image resolution and the efficiency of the team. Because the shape of the field is unknown, traditional approaches that rely on an accurate mathematical model of the field may fail. It is thus promising to address the problem with a model-free approach. We proposed a model-free Multi-Agent Reinforcement Learning (MARL) algorithm that combines Correlated Equilibrium strategy in Game Theory and Function approximation techniques to effectively overcome challenges in MARL such as the complex dynamics of the system and the curse of dimensionality. From studying the two distinct approaches, we will draw some insights in solving optimal field coverage problems regarding each approach. Advisors/Committee Members: La, Hung M. (advisor), Feil-Seifer, David (committee member), Xu, Hao (committee member).

Subjects/Keywords: Distributed control; Multi-Agent Reinforcement Learning; Multi-Robot Systems; Optimal field coverage; UAV

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pham, H. X. (2018). Design Distributed Control and Learning Algorithms for a Team of UAVs for Optimal Field Coverage. (Thesis). University of Nevada – Reno. Retrieved from http://hdl.handle.net/11714/4886

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Pham, Huy X. “Design Distributed Control and Learning Algorithms for a Team of UAVs for Optimal Field Coverage.” 2018. Thesis, University of Nevada – Reno. Accessed March 03, 2021. http://hdl.handle.net/11714/4886.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Pham, Huy X. “Design Distributed Control and Learning Algorithms for a Team of UAVs for Optimal Field Coverage.” 2018. Web. 03 Mar 2021.

Vancouver:

Pham HX. Design Distributed Control and Learning Algorithms for a Team of UAVs for Optimal Field Coverage. [Internet] [Thesis]. University of Nevada – Reno; 2018. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/11714/4886.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pham HX. Design Distributed Control and Learning Algorithms for a Team of UAVs for Optimal Field Coverage. [Thesis]. University of Nevada – Reno; 2018. Available from: http://hdl.handle.net/11714/4886

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

16. VILLA MARTINEZ, DAVID FELIPE. A population dynamics approach to distributed coverage control .

Degree: 2015, Universidad de los Andes

URL: https://documentodegrado.uniandes.edu.co/documentos/7296.pdf

► El objetivo de este proyecto es diseñar una estrategia de control que presente una solución al problema de control de cobertura, usando juegos evolutivos y… (more)

Subjects/Keywords: Best response dynamics; Coverage control; Cooperative control; Distributed optimization.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

VILLA MARTINEZ, D. F. (2015). A population dynamics approach to distributed coverage control . (Thesis). Universidad de los Andes. Retrieved from https://documentodegrado.uniandes.edu.co/documentos/7296.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

VILLA MARTINEZ, DAVID FELIPE. “A population dynamics approach to distributed coverage control .” 2015. Thesis, Universidad de los Andes. Accessed March 03, 2021. https://documentodegrado.uniandes.edu.co/documentos/7296.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

VILLA MARTINEZ, DAVID FELIPE. “A population dynamics approach to distributed coverage control .” 2015. Web. 03 Mar 2021.

Vancouver:

VILLA MARTINEZ DF. A population dynamics approach to distributed coverage control . [Internet] [Thesis]. Universidad de los Andes; 2015. [cited 2021 Mar 03]. Available from: https://documentodegrado.uniandes.edu.co/documentos/7296.pdf.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

VILLA MARTINEZ DF. A population dynamics approach to distributed coverage control . [Thesis]. Universidad de los Andes; 2015. Available from: https://documentodegrado.uniandes.edu.co/documentos/7296.pdf

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

17. Atinc, Gokhan. Safe and reliable dynamic coverage control for multi-agent systems.

Degree: PhD, 0133, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/49682

► In this dissertation, we study the dynamic coverage problem for multi-agent systems, where the main objective of a group of mobile agents is to explore… (more)

Subjects/Keywords: Coverage control; multi-agent systems; swarming; collective behavior; cooperative control; autonomous systems; collision avoidance; proximity maintenance

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Atinc, G. (2014). Safe and reliable dynamic coverage control for multi-agent systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/49682

Chicago Manual of Style (16^th Edition):

Atinc, Gokhan. “Safe and reliable dynamic coverage control for multi-agent systems.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed March 03, 2021. http://hdl.handle.net/2142/49682.

MLA Handbook (7^th Edition):

Atinc, Gokhan. “Safe and reliable dynamic coverage control for multi-agent systems.” 2014. Web. 03 Mar 2021.

Vancouver:

Atinc G. Safe and reliable dynamic coverage control for multi-agent systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/2142/49682.

Council of Science Editors:

Atinc G. Safe and reliable dynamic coverage control for multi-agent systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/49682

18. Oksanen, Timo. Path Planning Algorithms for Agricultural Field Machines.

Degree: 2007, Helsinki University of Technology

URL: http://lib.tkk.fi/Diss/2007/isbn9789512290802/

►

In this thesis, a coverage path planning problem is discussed in the case of agricultural fields and agricultural machines. Methods and algorithms to solve this… (more)

▼

In this thesis, a coverage path planning problem is discussed in the case of agricultural fields and agricultural machines. Methods and algorithms to solve this problem are developed. The necessary condition is to cover the whole field, while the goal is to find as efficient a route as possible. As yet, there is no universal algorithm or method capable of solving the problem in all cases. In this thesis, two new approaches to solve the coverage path planning problem in the case of agricultural fields and agricultural machines are presented. In the first algorithm, the field plot is split into subfields that are simple to drive. Each subfield is constructed from trapezoids, the sides of which are attached. Thus the opposite sides of each subfield are parallel. In the search method, the best driving direction for each subfield is found. In the second algorithm, the path is planned on the basis of the machine's current state. Inspired by model predictive control, all the possible routes are simulated over the horizon of one route around the field or one back-and-forth swath. The best of the simulated routes is selected and the first part of that route is applied, up to the next turning. In the next turning, the algorithm is repeated. There are advantages and drawbacks in both algorithms. Neither of them solves the universal problem optimally. Nevertheless, the developed algorithms are remarkable steps towards finding a way to solve the problem. As a side-result, the properties of Finnish field plots are discussed and the field plot shape analysis is made. The classification of field plots based on shape was investigated, but only 25% of field plots belong to one or other simple-shape classes, such as rectangles and triangles, while the rest are more or less undetermined shapes. The other side-result is a trajectory generation for a tractor-trailer vehicle in a headland. The problem is formulated as an optimal control problem and solved using available methods and tools. With this approach, the trajectory can be solved for any headland width and angle.

Tässä väitöskirjassa käsitellään peltoliikenteen reitinsuunnitteluun liittyviä ongelmia ja kehitetään menetelmiä ja työkaluja ongelmien ratkaisemiseen. Reitinsuunnittelun ehdottomana vaatimuksena on kattaa koko pelto ja pyrkiä suunnittelemaan reitti mahdollisimman tehokkaaksi. Vielä ei tunneta mitään yleistä menetelmää jolla reitinsuunnittelu voitaisiin ratkaista optimaalisesti kaikissa tapauksissa. Tässä väitöskirjassa esitetään kaksi uutta lähestymistapaa ratkaisemaan peltoliikenteen reitinsuunnittelu. Ensimmäisessä menetelmässä pilkotaan hankalan muotoinen lohko useampaan osalohkoon, jotka erillisinä on helppo ajaa. Osalohkon muoto koostuu kyljistään yhteenliitetyistä puolisuunnikkaista, ja siten osalohkon vastakkaiset sivut ovat myös samansuuntaiset. Hakumenetelmässä etsitään kullekin osalohkolle paras ajosuunta. Toisessa menetelmässä suunnitellaan reittiä koneen sen hetkisestä tilanteesta lähtien simuloimalla kaikki mahdolliset reitit eteenpäin yhden…

Advisors/Committee Members: Helsinki University of Technology, Department of Automation and Systems Technology, Automation Technology Laboratory.

Subjects/Keywords: coverage path planning; agricultural machines; agricultural fields; shape analysis; optimal control; algorithms; reitinsuunnittelu; maatalouskoneet; peltoviljely; pellot; muotoanalyysi; optimisäätö; algoritmit

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Oksanen, T. (2007). Path Planning Algorithms for Agricultural Field Machines. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2007/isbn9789512290802/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Oksanen, Timo. “Path Planning Algorithms for Agricultural Field Machines.” 2007. Thesis, Helsinki University of Technology. Accessed March 03, 2021. http://lib.tkk.fi/Diss/2007/isbn9789512290802/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Oksanen, Timo. “Path Planning Algorithms for Agricultural Field Machines.” 2007. Web. 03 Mar 2021.

Vancouver:

Oksanen T. Path Planning Algorithms for Agricultural Field Machines. [Internet] [Thesis]. Helsinki University of Technology; 2007. [cited 2021 Mar 03]. Available from: http://lib.tkk.fi/Diss/2007/isbn9789512290802/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oksanen T. Path Planning Algorithms for Agricultural Field Machines. [Thesis]. Helsinki University of Technology; 2007. Available from: http://lib.tkk.fi/Diss/2007/isbn9789512290802/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of California – Riverside

19. Lu, Jiahui. Experimental Validation of Game Theory-Based Coverage Control.

Degree: Electrical Engineering, 2016, University of California – Riverside

URL: http://www.escholarship.org/uc/item/4vf0q41t

► A game theory based coverage control algorithm is introduced first. After explanation of algorithm, softwares, program environment and hardwares are presented. A top level diagram… (more)

Subjects/Keywords: Electrical engineering; ARIA library; C++ code; Coverage Control; Game Theory; Mobile Sensor Network; Pioneer 3-AT

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lu, J. (2016). Experimental Validation of Game Theory-Based Coverage Control. (Thesis). University of California – Riverside. Retrieved from http://www.escholarship.org/uc/item/4vf0q41t

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lu, Jiahui. “Experimental Validation of Game Theory-Based Coverage Control.” 2016. Thesis, University of California – Riverside. Accessed March 03, 2021. http://www.escholarship.org/uc/item/4vf0q41t.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lu, Jiahui. “Experimental Validation of Game Theory-Based Coverage Control.” 2016. Web. 03 Mar 2021.

Vancouver:

Lu J. Experimental Validation of Game Theory-Based Coverage Control. [Internet] [Thesis]. University of California – Riverside; 2016. [cited 2021 Mar 03]. Available from: http://www.escholarship.org/uc/item/4vf0q41t.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lu J. Experimental Validation of Game Theory-Based Coverage Control. [Thesis]. University of California – Riverside; 2016. Available from: http://www.escholarship.org/uc/item/4vf0q41t

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

20. Sousa, Marco Décio Baptista. Self-diagnosing and optimization of low coverage and high interference in 3G/4G: radio access networks.

Degree: 2017, Repositório Científico do Instituto Politécnico de Lisboa

URL: https://www.rcaap.pt/detail.jsp?id=oai:repositorio.ipl.pt:10400.21/7984

►

Mestrado em Engenharia Electrónica e Telecomunicações - Dissertação

Self-Organizing Networks (SON) solutions have been developed and implemented in the last years as a Mobile Network… (more)

▼

Mestrado em Engenharia Electrónica e Telecomunicações - Dissertação

Self-Organizing Networks (SON) solutions have been developed and implemented in the last years as a Mobile Network Operator (MNO) strategy to deal with the complexity of current networks. This research work, focuses on the self-optimization branch of SON solutions. It aims to empower a network with automatic capabilities for detecting and optimizing poor Radio Frequency (RF) performance scenarios. The detection and optimization of those scenarios, is based on Drive Test (DT) data. This leads to the development of a DT classi cation model to assert the quality of data collected through DT for a given cell, as it supports all decision making in terms of detection and optimization of poor RF situations. The DT model was calibrated with subjective testing in the form of inquiries made to fty Radio Access Network (RAN) engineers. Three algorithms were implemented for detection of low coverage and high interference scenarios. Besides identifying and dividing into clusters the DT data that denotes each problem, harshness metrics at cell and cluster level allow to identify the most severe situations. Moreover, an antenna physical parameter optimization algorithm, based on a Particle Swarm Optimization (PSO) algorithm, is able to purpose new Electrical Downtilt (EDT), Mechanical Downtilt (MDT) or the antenna orientation to improve or x the detected RF problems. All algorithms were tested with real MNO DT data and network topology, mainly on urban scenarios, where the detection and optimization is more critical for MNO. Regarding the detection algorithms, in urban scenario, it was established that the situations of high interference were more prevailing than the low coverage. The antenna self-optimization algorithm achieved an average gain of 78% on the tested cases.

As redes SON têm sido, cada vez mais, uma das fortes apostas por parte das operadoras móveis para fazer face a crescente complexidade das redes móveis. Este trabalho de pesquisa foca-se no ramo, das redes SON, de optimização automática. O objectivo e dotar uma rede móvel de capacidades de detecção e optimização de situações de má performance rádio. Tendo em conta que toda a detecção e optimização e baseada em dados recolhidos por DT, surgiu a necessidade de desenvolver um modelo de qualidade para DT. Este modelo e usado como referência em termos de qualidade de dados disponíveis, para cada célula analisada. O modelo de qualidade de DT foi calibrado através de questionários subjectivos, realizados a cinquenta engenheiros rádio. Foram implementados três algoritmos para detecção de situações de má cobertura e interferência. Além de identificar e dividir em clusters os dados de DT com cada um dos problemas mencionados, as métricas de gravidade ao nível do cluster e da célula, permitem identificar os cenários mais graves. Em termos de optimizaçãoo, foi desenvolvido e implementado um algoritmo de optimização de tilts eléctrico e mecânico ou a orientação da antena, com base num algoritmo PSO. Todos…

Advisors/Committee Members: Vieira, Pedro Manuel de Almeida Carvalho, Martins, André Eduardo Ponciano.

Subjects/Keywords: Coverage detection; Interference control; Tilt Optimization; LTE; UMTS; SON; Deteção de cobertura; Controlo de interferência; Optimização de tilts

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sousa, M. D. B. (2017). Self-diagnosing and optimization of low coverage and high interference in 3G/4G: radio access networks. (Thesis). Repositório Científico do Instituto Politécnico de Lisboa. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:repositorio.ipl.pt:10400.21/7984

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Sousa, Marco Décio Baptista. “Self-diagnosing and optimization of low coverage and high interference in 3G/4G: radio access networks.” 2017. Thesis, Repositório Científico do Instituto Politécnico de Lisboa. Accessed March 03, 2021. https://www.rcaap.pt/detail.jsp?id=oai:repositorio.ipl.pt:10400.21/7984.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Sousa, Marco Décio Baptista. “Self-diagnosing and optimization of low coverage and high interference in 3G/4G: radio access networks.” 2017. Web. 03 Mar 2021.

Vancouver:

Sousa MDB. Self-diagnosing and optimization of low coverage and high interference in 3G/4G: radio access networks. [Internet] [Thesis]. Repositório Científico do Instituto Politécnico de Lisboa; 2017. [cited 2021 Mar 03]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:repositorio.ipl.pt:10400.21/7984.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sousa MDB. Self-diagnosing and optimization of low coverage and high interference in 3G/4G: radio access networks. [Thesis]. Repositório Científico do Instituto Politécnico de Lisboa; 2017. Available from: https://www.rcaap.pt/detail.jsp?id=oai:repositorio.ipl.pt:10400.21/7984

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Ottawa

21. Yazdan Panah, Arian. Nonuniform Coverage with Time-Varying Risk Density Function .

Degree: 2015, University of Ottawa

URL: http://hdl.handle.net/10393/33007

► Multi-agent systems are extensively used in several applications. An important class of applications involves the optimal spatial distribution of a group of mobile robots on… (more)

Subjects/Keywords: Nonuniform coverage; Risk density function; Agents; Asymptotic stability; Co–operative control; Optimization problems; Voronoi tessellation; State feedback

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yazdan Panah, A. (2015). Nonuniform Coverage with Time-Varying Risk Density Function . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/33007

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Yazdan Panah, Arian. “Nonuniform Coverage with Time-Varying Risk Density Function .” 2015. Thesis, University of Ottawa. Accessed March 03, 2021. http://hdl.handle.net/10393/33007.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Yazdan Panah, Arian. “Nonuniform Coverage with Time-Varying Risk Density Function .” 2015. Web. 03 Mar 2021.

Vancouver:

Yazdan Panah A. Nonuniform Coverage with Time-Varying Risk Density Function . [Internet] [Thesis]. University of Ottawa; 2015. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10393/33007.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yazdan Panah A. Nonuniform Coverage with Time-Varying Risk Density Function . [Thesis]. University of Ottawa; 2015. Available from: http://hdl.handle.net/10393/33007

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Southern California

22. Poduri, Sameera. Mobility-based topology control of robot networks.

Degree: PhD, Computer Science, 2008, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/115883/rec/4109

► A fundamental problem that arises in realizing large-scale wireless networks of mobile robots is that of controlling the communication topology. This thesis makes three contributions… (more)

▼ A fundamental problem that arises in realizing large-scale wireless networks of mobile robots is that of controlling the communication topology. This thesis makes three contributions to the area of mobility-based topology control in robot networks.; First, this work proposes local, geometric conditions on robot positions that guarantee global network connectivity. When combined with distributed controllers for mobile robots, these conditions maximize sensing coverage while maintaining connectivity. The key idea is the introduction of a new construct – a Neighbor-Every-Theta (NET) graph – in which each node has at least one neighbor in every angular sector of size theta. We prove that for theta < pi, NET graphs are guaranteed to have an edge-connectivity of at least floor(2 pi/theta), even with an irregular radio communication range. The NET conditions are integrated into an artificial potential field-based controller for distributed deployment.; Second, for robots communicating over unreliable wireless links, a coalescence behavior is introduced, in which disconnected robots recover connectivity by searching for others. Our contribution is an asymptotic analysis of coalescence time which quantifies the trade-off between the cost of maintaining connectivity and that of repairing connectivity – the first such guideline for designing controllers for robot networks.; Finally, having shown how to construct and maintain robot networks with maximal coverage, we address a problem motivated by the performance of cheap, low-resolution cameras in complex outdoor environments. This variation of the sensor coverage problem is the first to address the case where the sensing performance of each robot carrying a camera depends on the local environmental conditions. We present a distributed reconfiguration algorithm for this case, and validate it using a network of real Cyclops cameras placed in environments with varying illumination and backgrounds. Advisors/Committee Members: Sukhatme, Gaurav S. (Committee Chair), Golubchik, Leana (Committee Member), Krishnamachari, Bhaskar (Committee Member).

Subjects/Keywords: robot networks; deployment; topology control; coverage optimization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Poduri, S. (2008). Mobility-based topology control of robot networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/115883/rec/4109

Chicago Manual of Style (16^th Edition):

Poduri, Sameera. “Mobility-based topology control of robot networks.” 2008. Doctoral Dissertation, University of Southern California. Accessed March 03, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/115883/rec/4109.

MLA Handbook (7^th Edition):

Poduri, Sameera. “Mobility-based topology control of robot networks.” 2008. Web. 03 Mar 2021.

Vancouver:

Poduri S. Mobility-based topology control of robot networks. [Internet] [Doctoral dissertation]. University of Southern California; 2008. [cited 2021 Mar 03]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/115883/rec/4109.

Council of Science Editors:

Poduri S. Mobility-based topology control of robot networks. [Doctoral Dissertation]. University of Southern California; 2008. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/115883/rec/4109

University of Arkansas

23. Priess, Grant Lawson. Mitigating Herbicide Impacts to Soybean.

Degree: MS, 2019, University of Arkansas

URL: https://scholarworks.uark.edu/etd/3480

► The rapidity in evolution of herbicide-resistant weeds and the resulting cost to U.S. farmers demonstrate the need to responsibly steward the limited number of… (more)

▼ The rapidity in evolution of herbicide-resistant weeds and the resulting cost to U.S. farmers demonstrate the need to responsibly steward the limited number of herbicides available in agricultural systems. To reduce weed emergence and likewise added selection pressures placed on herbicides, early-season crop canopy formation has been promoted. However, impacts to soybean following a potentially injurious herbicide application have not been thoroughly evaluated. Therefore, field experiments were conducted to determine whether: 1) soybean injury from metribuzin or flumioxazin delayed canopy formation or changed the incidence of pathogen colonization; 2) residual herbicides applied preplant reduced the potential for soybean injury and achieved the same longevity of weed control as herbicides applied at planting; 3) POST-applied acetolactate synthase (ALS)- and protoporphyrinogen oxidase (PPO)-inhibiting herbicides alone and in combination with glufosinate delayed canopy formation or impacted grain yield. Few interactions between herbicides and soil-borne pathogens were observed. Results from various experiments showed that soybean canopy formation was delayed after an application of preemergence (PRE)-residual herbicides and postemergence (POST)-foliar-active herbicides. However, delays in crop canopy formation caused by a PRE application of metribuzin and flumioxazin were only observed in varieties with sensitivity to the herbicide. Soybean injury caused by PRE applications were mitigated by applying herbicides 14 days prior to planting. Treatments that were applied 14 days prior to planting and contained an effective herbicide with a half-life greater than 70 days suffered no reduction in longevity of Palmer amaranth control when compared to the same herbicide applied at planting. POST-applied herbicides delayed soybean canopy formation relative to the amount of injury present following application. Delays in canopy formation can result in a lengthened period of weed emergence, subsequently increasing the need for additional weed control and increasing selection pressure on sequentially applied herbicides. Nomenclature: Flumioxazin, glufosinate, metribuzin, Palmer amaranth, Amaranthus palmeri (S.) Wats., soybean Glycine max (L.) Merr. Key words: Acetolactate synthase (ALS)-inhibiting herbicides, canopy formation, half-life, herbicide-resistance weeds, POST foliar-active herbicide, preplant, protoporphyrinogen oxidase (PPO)-inhibiting herbicides, PRE-residual herbicide, soil-borne pathogen, soybean injury Advisors/Committee Members: Jason Norsworthy, Bob Scott, Ed Gbur.

Subjects/Keywords: canopy coverage; herbicide; herbicide resistance; pathogen; soybean; weed control; Agricultural Science; Agronomy and Crop Sciences; Plant Pathology; Weed Science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Priess, G. L. (2019). Mitigating Herbicide Impacts to Soybean. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/3480

Chicago Manual of Style (16^th Edition):

Priess, Grant Lawson. “Mitigating Herbicide Impacts to Soybean.” 2019. Masters Thesis, University of Arkansas. Accessed March 03, 2021. https://scholarworks.uark.edu/etd/3480.

MLA Handbook (7^th Edition):

Priess, Grant Lawson. “Mitigating Herbicide Impacts to Soybean.” 2019. Web. 03 Mar 2021.

Vancouver:

Priess GL. Mitigating Herbicide Impacts to Soybean. [Internet] [Masters thesis]. University of Arkansas; 2019. [cited 2021 Mar 03]. Available from: https://scholarworks.uark.edu/etd/3480.

Council of Science Editors:

Priess GL. Mitigating Herbicide Impacts to Soybean. [Masters Thesis]. University of Arkansas; 2019. Available from: https://scholarworks.uark.edu/etd/3480

Grand Valley State University

24. Xu, Xiangyu. Intelligent Roadside Unit Deployment in Vehicular Network.

Degree: 2020, Grand Valley State University

URL: https://scholarworks.gvsu.edu/theses/994

► Intelligent Transportation System (ITS) has been an important research area in building the foundational infrastructures of self-driving vehicles and improving traffic efficiency of future transportation… (more)

Subjects/Keywords: Intelligent Transportation System; Road Side Unit; Vehicular Network; Deployment; Data Storage; Coverage; Automotive Engineering; Navigation, Guidance, Control, and Dynamics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Xu, X. (2020). Intelligent Roadside Unit Deployment in Vehicular Network. (Thesis). Grand Valley State University. Retrieved from https://scholarworks.gvsu.edu/theses/994

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Xu, Xiangyu. “Intelligent Roadside Unit Deployment in Vehicular Network.” 2020. Thesis, Grand Valley State University. Accessed March 03, 2021. https://scholarworks.gvsu.edu/theses/994.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Xu, Xiangyu. “Intelligent Roadside Unit Deployment in Vehicular Network.” 2020. Web. 03 Mar 2021.

Vancouver:

Xu X. Intelligent Roadside Unit Deployment in Vehicular Network. [Internet] [Thesis]. Grand Valley State University; 2020. [cited 2021 Mar 03]. Available from: https://scholarworks.gvsu.edu/theses/994.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xu X. Intelligent Roadside Unit Deployment in Vehicular Network. [Thesis]. Grand Valley State University; 2020. Available from: https://scholarworks.gvsu.edu/theses/994

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Στεργιόπουλος, Ιωάννης. Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων.

Degree: 2014, University of Patras

URL: http://hdl.handle.net/10889/8238

► Το κυρίως αντικείμενο της διατριβής αυτής είναι ο σχεδιασμός και η ανάλυση αποκεντρωμένων τεχνικών ελέγχου για επίτευξη μέγιστης κάλυψης από κινούμενα δίκτυα αισθητήρων. Λόγω των… (more)

▼ Το κυρίως αντικείμενο της διατριβής αυτής είναι ο σχεδιασμός και η ανάλυση αποκεντρωμένων τεχνικών ελέγχου για επίτευξη μέγιστης κάλυψης από κινούμενα δίκτυα αισθητήρων. Λόγω των πολλών εφαρμογών αυτών σε αποστολές σχετιζόμενες με εξερεύνηση περιοχών ενδιαφέροντος, περιβαλλοντική δειγματοληψία, φύλαξη ή ακόμα και θέματα ασφάλειας, μία μεγάλη μερίδα της επιστημονικής κοινότητας έχει στρέψει το ενδιαφέρον της στην ανάπτυξη μεθόδων για βέλτιστη (ει δυνατόν) περιβαλλοντική αντίληψη μέσω αισθητήρων από αυτόνομες ομάδες ρομποτικών συστημάτων. Τέτοιες ομάδες, συνήθως τοποθετούμενες αρχικώς στις περιοχές ενδιαφέροντος, σχεδιάζονται με στόχο τον αποκεντρωμένο έλεγχό τους, αντί ενός καθολικού εποπτικού συστήματος, με στόχο να επιτύχουν στην εκάστοτε αποστολή. Στα πρώτα στάδια της διατριβής αυτής, το πρόβλημα της κάλυψης μιας περιοχής ενδιαφέροντος από μία ομάδα όμοιων κόμβων αναλύεται από υπολογιστική σκοπιά. Οι κινούμενοι κόμβοι υποθέτονται ότι υπακούν σε απλοϊκό κινηματικό μοντέλο διακριτού χρόνου, ενώ η αισθητήρια επίδοσή τους θεωρείται ακτινική, περιορισμένης εμβέλειας, ομοιόμορφη γύρω από τον κόμβο. Σαν πρώτη προσέγγιση, η κατεύθυνση σε κάθε χρονική στιγμή για βέλτιστη κάλυψη καθορίζεται βάσει τεχνικών διαμέρισης του χώρου βασιζόμενες στην έννοια της απόστασης. Η αναπτυσσόμενη στρατηγική επιτρέπει σταδιακή αύξηση της καλυπτόμενης επιφάνειας μεταξύ διαδοχικών βημάτων, ενώ έχει ως απαίτηση την κίνηση ενός μόνο επιτρεπτού κόμβου τη φορά. Στη συνέχεια, το προαναφερθέν σχέδιο επεκτείνεται για την περίπτωση ετερογενών δικτύων, όπου η ετερογένεια αντικατοπτρίζεται στις άνισες εμβέλειες απόδοσης αίσθησης των κόμβων. Επιπροσθέτως, επέκταση σε μοντέλο συνεχούς χρόνου επιτρέπει την κίνηση όλων των κόμβων του δικτύου ταυτόχρονα, αυξάνοντας ιδιαίτερα τον χρόνο σύγκλισης προς την βέλτιστη κατάσταση, ειδικά για μεγάλης κλίμακας δίκτυα. Μία εναλλακτική διαμέριση του χώρου αναπτύσσεται, η οποία βασίζεται κυρίως στα αισθητήρια μοτίβα των κόμβων, παρά στις θέσεις των κόμβων καθεαυτές. Τα παραγόμενα κελιά του χώρου ανατιθέμενα στους κόμβους αποτελούν τον βασικό πυρήνα του αλγόριθμου οργάνωσης, με στόχο την αποκεντρωμένη οργάνωση της κινούμενης ομάδας, ώστε να επιτύχει βέλτιστη απόδοση κάλυψης. Υποκινούμενοι από την υψηλού–βαθμού ανισοτροπία που χαρακτηρίζει κάποιους τύπους αισθητήρων, όπως κατευθυντικά μικρόφωνα για ανίχνευση ήχου σε εφαρμογές ασφάλειας, ή ακόμα μοτίβα εκπομπής/λήψης κατευθυντικών κεραιών σε σενάρια τηλεπικοινωνιακής κάλυψης, η έρευνά μας επεκτείνεται πέραν του κλασσικού ακτινικού μοντέλου δίσκου αίσθησης. Βασιζόμενοι σε συγκεκριμένες ιδιότητες για επίπεδες κυρτές καμπύλες, μια αποκεντρωμένη στρατηγική οργάνωσης αναπτύχθηκε για δίκτυα που χαρακτηρίζονται από κυρτά αισθητήρια μοτίβα ίδιας κατευθυντικότητας. Παρότι η κυρτότητα των συνόλων αίσθησης φαίνεται να θέτει ένα μεγάλου βαθμού περιορισμό στο συνολικό πρόβλημα, στην πραγματικότητα προσπερνάται μέσω ανάθεσης αυτών ως το μέγιστο κυρτό χωρίο που εγγράφεται στο πρωταρχικώς ανισοτροπικό μοτίβο. Το σχήμα ελέγχου επεκτείνεται στη συνέχεια για την περίπτωση όπου… Advisors/Committee Members: Τζες, Αντώνιος, Stergiopoulos, Yiannis, Δερματάς, Ευάγγελος, Κούσουλας, Νικόλαος, Μάνεσης, Σταμάτης, Μουστάκας, Κωνσταντίνος, Νικολετσέας, Σωτήριος, Παπανικολόπουλος, Νικόλαος, Τζες, Αντώνιος.

Subjects/Keywords: Αποκεντρωμένη βελτιστοποίηση; Έλεγχος κάλυψης; Δικτυωμένα ρομποτικά συστήματα; Διαμέριση χώρου; Συνεργατικός έλεγχος; Ασύρματα δίκτυα αισθητήρων; 621.367 8; Distributed optimization; Coverage control; Networked robotics; Space partitioning; Cooperative control; Wireless sensor networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Στεργιόπουλος, �. (2014). Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων. (Doctoral Dissertation). University of Patras. Retrieved from http://hdl.handle.net/10889/8238

Chicago Manual of Style (16^th Edition):

Στεργιόπουλος, Ιωάννης. “Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων.” 2014. Doctoral Dissertation, University of Patras. Accessed March 03, 2021. http://hdl.handle.net/10889/8238.

MLA Handbook (7^th Edition):

Στεργιόπουλος, Ιωάννης. “Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων.” 2014. Web. 03 Mar 2021.

Vancouver:

Στεργιόπουλος �. Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων. [Internet] [Doctoral dissertation]. University of Patras; 2014. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10889/8238.

Council of Science Editors:

Στεργιόπουλος �. Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων. [Doctoral Dissertation]. University of Patras; 2014. Available from: http://hdl.handle.net/10889/8238

26. Yiannis, Stergiopoulos. Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων.

Degree: 2014, University of Patras; Πανεπιστήμιο Πατρών

URL: http://hdl.handle.net/10442/hedi/34878

► The main scope of this thesis is the design and analysis of distributed control strategies for achieving optimum area coverage in mobile sensor networks. Due… (more)

▼ The main scope of this thesis is the design and analysis of distributed control strategies for achieving optimum area coverage in mobile sensor networks. Due to the numerous applications of the latter in missions as area exploration, environmental sampling, patrolling, or even security, a large part of the scientific community has turned its interest on developing methods for achieving optimum, if possible, sensing environmental perception by groups of autonomous mobile agents. Such robotic teams, randomly deployed in areas of interest initially, are designed to coordinate their motion in a distributed manner, rather than via a global supervisory system, in order to succeed in the corresponding mission objective. At the first stages of this thesis, the coverage problem of an area of interest by a group of identical nodes is examined from a numerical point of view. The mobile nodes are considered to be governed by simple discrete-time kinodynamic motion, while their sensing performance is assumed radial, range-limited, uniform around the node. As a first approach, the optimum direction at each time step for optimum deployment achievement is determined based on proper distance-based space partitioning techniques. The developed concept allows for gradual increase in the covered area among consecutive steps, although suffers from allowing motion of one node at a time. In the sequel, the aforementioned concept is extended to the case of heterogeneous networks, where heterogeneity lays mainly in the unequal limited-range of the sensing performance of the nodes. In addition, extension to continuous-time allows for simultaneous motion of the nodes, increasing drastically the convergence time towards the optimal state, especially for large-scale networks. An alternate partitioning of the space is developed that is mainly based on the nodes' footprints, rather than their spatial positions only. The resulting assigned cells form the main core for the coordination algorithm proposed, in order to distributedly organize the mobile swarm to achieve optimum sensing performance. Motivated by the high-degree anisotropy that governs the sensing domains of certain types of sensors, i.e. directional microphones for sound sensing mainly for security applications, or even the radiation patterns of directional antennas in communication-coverage scenarios, our research is extended beyond the standard disc model of sensing. Based on certain properties for planar convex curves, a distributed strategy is developed for networks characterized by convex sensing domains of same orientation. Although convexity of the sensing sets may seem to impose a high level restriction to the overall setup, in fact can be assigned as the maximal convex inscribed set in any (originally) anisotropic pattern. The control scheme is further extended, in the sequel, for the case of adding an extra degree of freedom to the node's mobility abilities, incorporating different and time-varying orientations among the nodes patterns. The resulting scheme is proven to lead…

Subjects/Keywords: Αποκεντρωμένη βελτιστοποίηση; Έλεγχος κάλυψης; Δικτυωμένα ρομποτικά συστήματα; Διαμέριση χώρου; Συνεργατικός έλεγχος; Ασύρματα δίκτυα αισθητήρων; Distributed optimization; Coverage control; Networked robotic systems; Space partitioning; Cooperative control; Wireless sensor networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yiannis, S. (2014). Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων. (Thesis). University of Patras; Πανεπιστήμιο Πατρών. Retrieved from http://hdl.handle.net/10442/hedi/34878

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Yiannis, Stergiopoulos. “Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων.” 2014. Thesis, University of Patras; Πανεπιστήμιο Πατρών. Accessed March 03, 2021. http://hdl.handle.net/10442/hedi/34878.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Yiannis, Stergiopoulos. “Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων.” 2014. Web. 03 Mar 2021.

Vancouver:

Yiannis S. Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων. [Internet] [Thesis]. University of Patras; Πανεπιστήμιο Πατρών; 2014. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10442/hedi/34878.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yiannis S. Συνεργατικός έλεγχος δικτυωμένων ρομποτικών συστημάτων. [Thesis]. University of Patras; Πανεπιστήμιο Πατρών; 2014. Available from: http://hdl.handle.net/10442/hedi/34878

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

27. Hassan, Mohammad Mahdi. Multi-Point Stride Coverage: A New Genre of Test Coverage Criteria.

Degree: 2013, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/1130

► We introduce a family of coverage criteria, called Multi-Point Stride Coverage (MPSC). MPSC generalizes branch coverage to coverage of tuples of branches taken from the… (more)

Subjects/Keywords: Software Testing; Control Flow Coverage; Data Flow Coverage; Partial Execution Pattern; Software Engineering

…domains: “Control Flow Coverage” (CFC) and “Data Flow Coverage” (DFC) [… …focuses on the flow of control from one statement to another, such as the “branch coverage… …coverage measures in their Mission Control Technologies (MCT) project. Matteo et al… …coverage manipulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 9 3.1… …vs. predicted AM using MPSC and size for g = 0 and p = 2 (that is, branch coverage…

4 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hassan, M. M. (2013). Multi-Point Stride Coverage: A New Genre of Test Coverage Criteria. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/1130

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Hassan, Mohammad Mahdi. “Multi-Point Stride Coverage: A New Genre of Test Coverage Criteria.” 2013. Thesis, University of Western Ontario. Accessed March 03, 2021. https://ir.lib.uwo.ca/etd/1130.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Hassan, Mohammad Mahdi. “Multi-Point Stride Coverage: A New Genre of Test Coverage Criteria.” 2013. Web. 03 Mar 2021.

Vancouver:

Hassan MM. Multi-Point Stride Coverage: A New Genre of Test Coverage Criteria. [Internet] [Thesis]. University of Western Ontario; 2013. [cited 2021 Mar 03]. Available from: https://ir.lib.uwo.ca/etd/1130.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hassan MM. Multi-Point Stride Coverage: A New Genre of Test Coverage Criteria. [Thesis]. University of Western Ontario; 2013. Available from: https://ir.lib.uwo.ca/etd/1130

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Ohio University

28. Hargis, Jared D. Through "Foreign" Eyes: The Guardian's Coverage of the Virginia Tech Massacre.

Degree: MS, Journalism (Communication), 2009, Ohio University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1243711225

► This thesis presents a textual analysis and a descriptive content analysis of how the British newspaper The Guardian covered the Virginia Tech school shootings that… (more)

Subjects/Keywords: Communication; Journalism; Virginia Tech; The Guardian; coverage of school shooting; Cho Seung-Hui; gun control; media coverage

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hargis, J. D. (2009). Through "Foreign" Eyes: The Guardian's Coverage of the Virginia Tech Massacre. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1243711225

Chicago Manual of Style (16^th Edition):

Hargis, Jared D. “Through "Foreign" Eyes: The Guardian's Coverage of the Virginia Tech Massacre.” 2009. Masters Thesis, Ohio University. Accessed March 03, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1243711225.

MLA Handbook (7^th Edition):

Hargis, Jared D. “Through "Foreign" Eyes: The Guardian's Coverage of the Virginia Tech Massacre.” 2009. Web. 03 Mar 2021.

Vancouver:

Hargis JD. Through "Foreign" Eyes: The Guardian's Coverage of the Virginia Tech Massacre. [Internet] [Masters thesis]. Ohio University; 2009. [cited 2021 Mar 03]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1243711225.

Council of Science Editors:

Hargis JD. Through "Foreign" Eyes: The Guardian's Coverage of the Virginia Tech Massacre. [Masters Thesis]. Ohio University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1243711225

Rhodes University

29. Malan, Chantelle Therese. The ‘obesity epidemic’ : an analysis of representations of obesity in mainstream South African newspapers post-1997.

Degree: MA, Faculty of Humanities, Political and International Studies, 2015, Rhodes University

URL: http://hdl.handle.net/10962/d1019751

► This study of 449 newspaper articles from South Africa from 1997 provides an analysis of the representations of obesity evinced in the corpus. The research… (more)

Subjects/Keywords: Obesity – South Africa; Obesity – Press coverage – South Africa; Obesity – Social aspects – South Africa; Discrimination against overweight persons – South Africa; Social medicine – South Africa; Agent (Philosophy); Social control – South Africa

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Malan, C. T. (2015). The ‘obesity epidemic’ : an analysis of representations of obesity in mainstream South African newspapers post-1997. (Masters Thesis). Rhodes University. Retrieved from http://hdl.handle.net/10962/d1019751

Chicago Manual of Style (16^th Edition):

Malan, Chantelle Therese. “The ‘obesity epidemic’ : an analysis of representations of obesity in mainstream South African newspapers post-1997.” 2015. Masters Thesis, Rhodes University. Accessed March 03, 2021. http://hdl.handle.net/10962/d1019751.

MLA Handbook (7^th Edition):

Malan, Chantelle Therese. “The ‘obesity epidemic’ : an analysis of representations of obesity in mainstream South African newspapers post-1997.” 2015. Web. 03 Mar 2021.

Vancouver:

Malan CT. The ‘obesity epidemic’ : an analysis of representations of obesity in mainstream South African newspapers post-1997. [Internet] [Masters thesis]. Rhodes University; 2015. [cited 2021 Mar 03]. Available from: http://hdl.handle.net/10962/d1019751.

Council of Science Editors:

Malan CT. The ‘obesity epidemic’ : an analysis of representations of obesity in mainstream South African newspapers post-1997. [Masters Thesis]. Rhodes University; 2015. Available from: http://hdl.handle.net/10962/d1019751

30. YANG YUANRUI. OPTIMIZED EFFECTIVE COVERAGE OF MOBILE ROBOT TEAM WITH REACTIVE NAVIGATION CAPABILITY IN UNCERTAIN ENVIRONMENT.

Degree: 2020, National University of Singapore

URL: https://scholarbank.nus.edu.sg/handle/10635/171822

Subjects/Keywords: multi-robot; coverage control; non-constant model; optimization; navigation; formation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

YUANRUI, Y. (2020). OPTIMIZED EFFECTIVE COVERAGE OF MOBILE ROBOT TEAM WITH REACTIVE NAVIGATION CAPABILITY IN UNCERTAIN ENVIRONMENT. (Thesis). National University of Singapore. Retrieved from https://scholarbank.nus.edu.sg/handle/10635/171822

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

YUANRUI, YANG. “OPTIMIZED EFFECTIVE COVERAGE OF MOBILE ROBOT TEAM WITH REACTIVE NAVIGATION CAPABILITY IN UNCERTAIN ENVIRONMENT.” 2020. Thesis, National University of Singapore. Accessed March 03, 2021. https://scholarbank.nus.edu.sg/handle/10635/171822.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

YUANRUI, YANG. “OPTIMIZED EFFECTIVE COVERAGE OF MOBILE ROBOT TEAM WITH REACTIVE NAVIGATION CAPABILITY IN UNCERTAIN ENVIRONMENT.” 2020. Web. 03 Mar 2021.

Vancouver:

YUANRUI Y. OPTIMIZED EFFECTIVE COVERAGE OF MOBILE ROBOT TEAM WITH REACTIVE NAVIGATION CAPABILITY IN UNCERTAIN ENVIRONMENT. [Internet] [Thesis]. National University of Singapore; 2020. [cited 2021 Mar 03]. Available from: https://scholarbank.nus.edu.sg/handle/10635/171822.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

YUANRUI Y. OPTIMIZED EFFECTIVE COVERAGE OF MOBILE ROBOT TEAM WITH REACTIVE NAVIGATION CAPABILITY IN UNCERTAIN ENVIRONMENT. [Thesis]. National University of Singapore; 2020. Available from: https://scholarbank.nus.edu.sg/handle/10635/171822

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations