Forecasting the future: an overview of the strategic planning of the Bournemouth and Poole conurbation

An important part of strategic planning’s purpose should be to attempt to forecast the future, not simply to belatedly respond to events, or accept the future as inevitable. This paper puts forward a conceptual approach for seeking to achieve these aims and uses the Bournemouth and Poole area in Dorset as a vehicle for applying the basic methodology. The area has been chosen because of the significant issues that it currently faces in planning terms; and its future development possibilities. In order that alternative future choices for the area – different ‘developmental trajectories’ – can be evaluated, they must be carefully and logically constructed. Four Futures for Bournemouth/Poole have been put forward; they are titled and colour-coded: Future One is Maximising Growth – Golden Prospect which seeks to achieve the highest level of economic prosperity of the area; Future Two is Incremental Growth – Solid Silver which attempts to facilitate a steady, continuing, controlled pattern of the development for the area; Future Three is Steady State – Cobalt Blue which suggests that people in the area could be more concerned with preserving their quality of life in terms of their leisure and recreation rather than increasing wealth; Future Four is Environment First – Jade Green which makes the area’s environmental protection its top priority even at the possible expense of economic prosperity. The scenarios proposed here are not sacrosanct. Nor are they simply confined to the Bournemouth and Poole area. In theory, suitably modified, they could use in a variety of different contexts. Consideration of the scenarios – wherever located - might then generate other, additional scenarios. These are called hybrids, alloys and amalgams. Likewise it might identify some of them as inappropriate or impossible. Most likely, careful consideration of the scenarios will suggest hybrid scenarios, in which features from different scenarios are combined to produce alternative or additional futures for consideration. The real issue then becomes how best to fashion such a future for the particular area under consideration

Path planning of robots in noisy workspaces using learning automata

The problem of a manipulator operating in a noisy workspace and required to move from an initial fixed position P0 to a final position Pf is considered. However, Pf is corrupted by noise, giving rise to Pˆf, which may be obtained by sensors. The use of learning automata is proposed to tackle this problem. An automaton is placed at each joint of the manipulator which moves according to the action chosen by the automaton (forward, backward, stationary) at each instant. The simultaneous reward or penalty of the automata enables avoiding any inverse kinematics computations that would be necessary if the distance of each joint from the final position had to be calculated. Three variable-structure learning algorithms are used, i.e., the discretized linear reward-penalty (DLR-P, the linear reward-penalty (LR-P ) and a nonlinear scheme. Each algorithm is separately tested with two (forward, backward) and three forward, backward, stationary) actions.

Trajectory planning of a robot using learning algorithms

The authors consider the problem of a robot manipulator operating in a noisy workspace. The manipulator is required to move from an initial position P(i) to a final position P(f). P(i) is assumed to be completely defined. However, P(f) is obtained by a sensing operation and is assumed to be fixed but unknown. The authors approach to this problem involves the use of three learning algorithms, the discretized linear reward-penalty (DLR-P) automaton, the linear reward-penalty (LR-P) automaton and a nonlinear reinforcement scheme. An automaton is placed at each joint of the robot and by acting as a decision maker, plans the trajectory based on noisy measurements of P(f).

Techniques for image analysis of movement of juveniles of root-knot nematodes encumbered with Pasteuria penetrans spores

Root-knot nematodes (Meloidogyne spp.) are the most significant plant-parasitic nematodes that damage many crops all over the world. The free-living second stage juvenile (J2) is the infective stage that enters plants. The J2s move in the soil water films to reach the root zone. The bacterium Pasteuria penetrans is an obligate parasite of root-knot nematodes, is cosmopolitan, frequently encountered in many climates and environmental conditions and is considered promising for the control of Meloidogyne spp. The infection potential of P. penetrans to nematodes is well studied but not the attachment effects on the movement of root-knot nematode juveniles, image analysis techniques were used to characterize movement of individual juveniles with or without P. penetrans spores attached to their cuticles. Methods include the study of nematode locomotion based on (a) the centroid body point, (b) shape analysis and (c) image stack analysis. All methods proved that individual J2s without P. penetrans spores attached have a sinusoidal forward movement compared with those encumbered with spores. From these separate analytical studies of encumbered and unencumbered nematodes, it was possible to demonstrate how the presence of P. penetrans spores on a nematode body disrupted the normal movement of the nematode.

Motion planning of autonomous vehicles in a non-autonomous vehicle environment without speed lanes

Planning is one of the key problems for autonomous vehicles operating in road scenarios. Present planning algorithms operate with the assumption that traffic is organised in predefined speed lanes, which makes it impossible to allow autonomous vehicles in countries with unorganised traffic. Unorganised traffic is though capable of higher traffic bandwidths when constituting vehicles vary in their speed capabilities and sizes. Diverse vehicles in an unorganised exhibit unique driving behaviours which are analysed in this paper by a simulation study. The aim of the work reported here is to create a planning algorithm for mixed traffic consisting of both autonomous and non-autonomous vehicles without any inter-vehicle communication. The awareness (e.g. vision) of every vehicle is restricted to nearby vehicles only and a straight infinite road is assumed for decision making regarding navigation in the presence of multiple vehicles. Exhibited behaviours include obstacle avoidance, overtaking, giving way for vehicles to overtake from behind, vehicle following, adjusting the lateral lane position and so on. A conflict of plans is a major issue which will almost certainly arise in the absence of inter-vehicle communication. Hence each vehicle needs to continuously track other vehicles and rectify plans whenever a collision seems likely. Further it is observed here that driver aggression plays a vital role in overall traffic dynamics, hence this has also been factored in accordingly. This work is hence a step forward towards achieving autonomous vehicles in unorganised traffic, while similar effort would be required for planning problems such as intersections, mergers, diversions and other modules like localisation.

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.

IT support for administrative planning of clinical practice.

The administration of clinical practice placements for nursing students is a highly complex and information driven task. This demonstration is intended to give insight into the web based system KliPP (a Swedish acronym for Clinical Practice Planning) and to discuss the possibilities for further development and use.

Multistage and coordinated planning of the expansion of transmission systems

In this paper, an efficient genetic algorithm (GA) is presented to solve the problem of multistage and coordinated transmission expansion planning. This is a mixed integer nonlinear programming problem, difficult for systems of medium and large size and high complexity. The GA presented has a set of specialized genetic operators and an efficient form of generation of the initial population that finds high quality suboptimal topologies for large size and high complexity systems. In these systems, multistage and coordinated planning present a lower investment than static planning. Tests results are shown in one medium complexity system and one large size high complexity system.

Planning of secondary distribution circuits through evolutionary algorithms

In this work, the planning of secondary distribution circuits is approached as a mixed integer nonlinear programming problem (MINLP). In order to solve this problem, a dedicated evolutionary algorithm (EA) is proposed. This algorithm uses a codification scheme, genetic operators, and control parameters, projected and managed to consider the specific characteristics of the secondary network planning. The codification scheme maps the possible solutions that satisfy the requirements in order to obtain an effective and low-cost projected system-the conductors' adequate dimensioning, load balancing among phases, and the transformer placed at the center of the secondary system loads. An effective algorithm for three-phase power flow is used as an auxiliary methodology of the EA for the calculation of the fitness function proposed for solutions of each topology. Results for two secondary distribution circuits are presented, whereas one presents radial topology and the other a weakly meshed topology. © 2005 IEEE.

Integrated planning of electric power distribution networks

In this work, a heuristic model for integrated planning of primary distribution network and secondary distribution circuits is proposed. A Tabu Search (TS) algorithm is employed to solve the planning of primary distribution networks. Evolutionary Algorithms (EA) are used to solve the planning model of secondary networks. The planning integration of both networks is carried out by means a constructive heuristic taking into account a set of integration alternatives between these networks. These integration alternatives are treated in a hierarchical way. The planning of primary networks and secondary distribution circuits is carried out based on assessment of the effects of the alternative solutions in the expansion costs of both networks simultaneously. In order to evaluate this methodology, tests were performed for a real-life distribution system taking into account the primary and secondary networks.

Short-term planning of electric power distribution networks using multiobjective genetic algorithim

The high active and reactive power level demanded by the distribution systems, the growth of consuming centers, and the long lines of the distribution systems result in voltage variations in the busses compromising the quality of energy supplied. To ensure the energy quality supplied in the distribution system short-term planning, some devices and actions are used to implement an effective control of voltage, reactive power, and power factor of the network. Among these devices and actions are the voltage regulators (VRs) and capacitor banks (CBs), as well as exchanging the conductors sizes of distribution lines. This paper presents a methodology based on the Non-Dominated Sorting Genetic Algorithm (NSGA-II) for optimized allocation of VRs, CBs, and exchange of conductors in radial distribution systems. The Multiobjective Genetic Algorithm (MGA) is aided by an inference process developed using fuzzy logic, which applies specialized knowledge to achieve the reduction of the search space for the allocation of CBs and VRs.