Multi-vehicle planning using RRT-connect

The problem of planning multiple vehicles deals with the design of an effective algorithm that can cause multiple autonomous vehicles on the road to communicate and generate a collaborative optimal travel plan. Our modelling of the problem considers vehicles to vary greatly in terms of both size and speed, which makes it suboptimal to have a faster vehicle follow a slower vehicle or for vehicles to drive with predefined speed lanes. It is essential to have a fast planning algorithm whilst still being probabilistically complete. The Rapidly Exploring Random Trees (RRT) algorithm developed and reported on here uses a problem specific coordination axis, a local optimization algorithm, priority based coordination, and a module for deciding travel speeds. Vehicles are assumed to remain in their current relative position laterally on the road unless otherwise instructed. Experimental results presented here show regular driving behaviours, namely vehicle following, overtaking, and complex obstacle avoidance. The ability to showcase complex behaviours in the absence of speed lanes is characteristic of the solution developed.

Optimal planning of cocoa clonal selection programmes

Data from three cocoa (Theobroma cacao) clonal selection trials are used to investigate the genetic and environmental components of variation in yield and the percentage of total pods affected by black pod disease (Phytophtora pod rot). Simulations based on these estimated components of variation are then used to discuss the best choice in future of numbers of clones, replicates and years of harvest to maximise selection advances in the traits measured. The three main conclusions are the need to increase the number of clones at the expense of the number of replicates of each clone, the diminishing returns from additional years of harvesting and the importance of widening the genetic base of the clones chosen to be tested.