Thomas E Kent

Thomas E Kent
University of Bristol | UB · Department of Computer Science

PhD in Aerospace Engineering

About

12
Publications
2,622
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
87
Citations

Publications

Publications (12)
Article
Full-text available
Through the use of autonomy Unmanned Aerial Vehicles (UAVs) can be used to solve a range of of multi-agent problems that exist in the real world, for example search and rescue or surveillance. Within these scenarios the global objective might often be better achieved if aspects of the problem can be optimally shared amongst its agents. However, in...
Preprint
Full-text available
To investigate the impact of Autonomous Vehicles (AVs) on urban congestion, this study looks at their performance at road intersections. Intersection performance has been studied across a range of traffic densities using a simple MATLAB simulation of two intersecting 1-D flows of homogeneous automated vehicles. This lacks the detail of more advance...
Article
Full-text available
VENTURER was one of the first three UK government funded research and innovation projects on Connected Autonomous Vehicles (CAVs) and was conducted predominantly in the South West region of the country. A series of increasingly complex scenarios conducted in an urban setting were used to: (i) evaluate the technology created as a part of the project...
Chapter
Full-text available
Modelling and planning as well as Machine Learning techniques such as Reinforcement Learning are often difficult in multi-agent problems. With increasing numbers of agents the decision space grows rapidly and is made increasingly complex through interacting agents. This paper is motivated by the question of if it is possible to train single-agent p...
Conference Paper
Full-text available
This paper looks to use both centralised and decentralised implementations of Evolutionary Algorithms to solve a dynamic variant of the Multi-Agent Travelling Salesman Problem. The problem is allocating an active set of tasks to a set of agents whilst simultaneously planning the route for each agent. The allocation and routing are closely coupled p...
Preprint
Full-text available
The Travelling Salesman and its variations are some of the most well known NP hard optimisation problems. This paper looks to use both centralised and decentralised implementations of Evolutionary Algorithms (EA) to solve a dynamic variant of the Multi-Agent Travelling Salesman Problem (MATSP). The problem is dynamic, requiring an on-line solution,...
Thesis
Full-text available
This thesis investigates the notion of fuel-reduction through formation flight for com- mercial aircraft, addressing the problems of global routing and assignment. A two stage centralised approach is presented, firstly, assuming a reduction in observed cost by flying in formation the routes, including rendezvous and break points, are calcu- lated t...
Article
Full-text available
This paper explores an analytic, geometric approach to finding optimal routes for commercial formation flight. A weighted extension of the classical Fermat point problem is used to develop a scalable methodology for the formation routing problem, enabling quick calculation of formation costs. This rapid evaluation allows the large-scale fleet assig...
Conference Paper
Full-text available
This paper explores an extension to a geometric approach of finding optimal routes for commercial formation flight. An adaption of the Breguet range equation, alongside specific aircraft characteristics, is used to represent realistic aircraft and underlying changes in weight as fuel is burnt off. Weighting schemes, for both nominal and differentia...
Conference Paper
Full-text available
This paper explores a geometric approach to finding optimal routes for commercial formation flight. A weighted extension of the classical Fermat point problem is used to develop an analytic solution to finding optimal routes, thereby reducing the complexity of the problem and enabling a quick evaluation. We then construct a method to decouple origi...

Network

Cited By