<p>Inom grossistbranschen associeras distributionen med svårigheter så som många kunder, små godsvolymer per kund och krav på korta ledtider. Många kunder kräver dessutom leveranser inom vissa tidsfönster. Dessa faktorer ställer höga krav på logistiken och skapar behov om hög leveransservice.</p><p>Inom transportbranschen råder idag generellt en relativt låg datormognad. Sedan tidigare finns avancerade digitala informationssystem tillgängliga för inköp, ordermottagning och lagerkontroll. Utvecklingen går dock mot att även logistik- och transportavdelningarna i större utsträckning börjar använda sig av mer avancerade transporttekniska hjälpmedel. Exempel på sådana är ruttoptimeringsprogram som kan användas för att beräkna optimala körvägar.</p><p>Servera R&S är en restauranggrossist som har ett antal lager utspridda i Sverige. Då deras kundkrets i stockholmsområdet under senare år blivit allt större har även antalet lossningsplatser ökat drastiskt. Godset till dessa förses från lager placerade i Norrköping och Västerås. Godset från Norrköping samlas och packas om i en terminal i Årsta innan det transporteras vidare till kunderna i Stockholm.</p><p>Servera R&S efterfrågade en analys av deras distribution i Stockholm. Detta för att undersöka om nuvarande distributionsstrategier är kostnadseffektiva. Syftet var att finna möjliga förändringar i verksamheten som skulle kunna medföra förbättringar för distributionen till kunder i Stockholm. Målet innefattade att finna förbättringsförslag som skulle innebära ett bättre användande av distributionsnätverkets resurser, minskade transportkostnader och ökad leveransservice.</p><p>Inledningsvis genomfördes en nulägesanalys för att kartlägga arbetsmetoder och tillvägagångssätt vid distributionen. Utifrån intervjuer och enkätundersökningar skapades sedan en modell av distributionen i vilken det verkliga trafikarbetet efterliknades. Denna användes vid simuleringar i ett ruttoptimeringsprogram med syftet att påvisa förbättringsmöjligheter. Under analysfasen studerades distributionsprocessen och simuleringsresultaten med målet att ta fram förslag på förbättringar och annorlunda tillvägagångssätt vid terminalhantering och transport.</p><p>Studien visar att det i distributionsprocessen finns stora möjligheter för förbättringar gällande terminalhantering och godstransporter. Ruttoptimeringen påvisar stora besparingsmöjligheter gällande transporttid, antalet körda kilometer och antalet använda fordon i distributionsarbetet. Simuleringsresultaten visar exempelvis en minskning av den totala transportsträckan med upp till 30 procent. Då transportsträckan står i direkt relation till transportkostnaderna skulle en sådan minskning innebära reducerade kostnader för distributionen.</p> / <p>Within the wholesale sector, the distribution is often associated with difficulties, such as many customers and a requirement for short lead times. A lot of customers also demand delivery within certain time windows. These factors all contribute to a high level of strain on the logistics.</p><p>In general, the amount of computer usage within the transportation industry is relatively low. However, advanced information systems are available for order handling and inventory management, and a lot of software for distribution planning and vehicle routing have surfaced as of recently. These often combine digital maps and optimization algorithms, and can be used for calculating optimized routes within the distribution.</p><p>Servera R&S is a wholesale company with a number of warehouses in different parts of Sweden. As of lately, their clientele in Stockholm has expanded, and the number of delivery points have increased drastically. The customers in Stockholm are provided with goods from warehouses in Norrköping and Västerås. The goods from Norrköping passes through a transfer terminal in Årsta before it is delivered to the customer in Stockholm.</p><p>Servera R&S is requesting an analysis of their distribution in Stockholm. They want to determine whether their distribution strategies are economically effective or not. Within this study, we aim to analyze different distribution strategies, which may or may not result in improvements of the efficiency of the distribution process. The purpose is to find solutions that better use the recourses of the distribution network (i.e. vehicles and personnel etc.), increase the level of delivery service and reduce the transportation costs.</p><p>A survey analysis was carried out to map work methods and procedures within the distribution process. Interviews and surveys were used in the process of creating a basis for the optimization tool. Simulations were performed in an attempt to demonstrate the possibilities for decreasing distribution costs through the use of a vehicle routing program. During the analysis, the distribution process and the results from the simulations were studied with an aim to find possible improvements in the way that goods and information are handled within the warehouses and during the transports.</p><p>The study shows a lot of possibilities for improvements within the distribution process. The route optimization prove a potential for decreasing costs regarding transportation time, distances and the number of vehicles used within the distribution. For example, the simulations show that the distances can be decreased with as much as 30 percent.</p>

The main body of this thesis consists of six appended papers. In the  first two, different  cooperative surveillance problems are considered. The second two consider different aspects of the trajectory planning problem, while the last two deal with observer design for mobile robotic and Euler-Lagrange systems respectively.In Papers A and B,  a combinatorial optimization based framework to cooperative surveillance missions using multiple Unmanned Ground Vehicles (UGVs) is proposed. In particular, Paper A  considers the the Minimum Time UGV Surveillance Problem (MTUSP) while Paper B treats the Connectivity Constrained UGV Surveillance Problem (CUSP). The minimum time formulation is the following. Given a set of surveillance UGVs and a polyhedral area, find waypoint-paths for all UGVs such that every point of the area is visible from  a point on a waypoint-path and such that the time for executing the search in parallel is minimized.  The connectivity constrained formulation  extends the MTUSP by additionally requiring the induced information graph to be  kept recurrently connected  at the time instants when the UGVs  perform the surveillance mission.  In these two papers, the NP-hardness of  both these problems are shown and decomposition techniques are proposed that allow us to find an approximative solution efficiently in an algorithmic manner.Paper C addresses the problem of designing a real time, high performance trajectory planner for an aerial vehicle that uses information about terrain and enemy threats, to fly low and avoid radar exposure on the way to a given target. The high-level framework augments Receding Horizon Control (RHC) with a graph based terminal cost that captures the global characteristics of the environment.  An important issue with RHC is to make sure that the greedy, short term optimization does not lead to long term problems, which in our case boils down to two things: not getting into situations where a collision is unavoidable, and making sure that the destination is actually reached. Hence, the main contribution of this paper is to present a trajectory planner with provable safety and task completion properties. Direct methods for trajectory optimization are traditionally based on a priori temporal discretization and collocation methods. In Paper D, the problem of adaptive node distribution is formulated as a constrained optimization problem, which is to be included in the underlying nonlinear mathematical programming problem. The benefits of utilizing the suggested method for  online  trajectory optimization are illustrated by a missile guidance example.In Paper E, the problem of active observer design for an important class of non-uniformly observable systems, namely mobile robotic systems, is considered. The set of feasible configurations and the set of output flow equivalent states are defined. It is shown that the inter-relation between these two sets may serve as the basis for design of active observers. The proposed observer design methodology is illustrated by considering a  unicycle robot model, equipped with a set of range-measuring sensors. Finally, in Paper F, a geometrically intrinsic observer for Euler-Lagrange systems is defined and analyzed. This observer is a generalization of the observer proposed by Aghannan and Rouchon. Their contractivity result is reproduced and complemented  by  a proof  that the region of contraction is infinitely thin. Moreover, assuming a priori bounds on the velocities, convergence of the observer is shown by means of Lyapunov's direct method in the case of configuration manifolds with constant curvature. / QC 20100622 / TAIS, AURES

<p>The main body of this thesis consists of four appended papers. The first two consider different aspects of the trajectory planning problem, while the last two deal with observer design for mobile robotic and Euler-Lagrange systems respectively.</p><p>The first paper addresses the problem of designing a real time, high performance trajectory planner for aerial vehicles. The main contribution is two-fold. Firstly, by augmenting a novel safety maneuver at the end of the planned trajectory, this paper extends previous results by having provable safety properties in a 3D setting. Secondly, assuming initial feasibility, the planning method is shown to have finite time task completion. Moreover, in the second part of the paper, the problem of simultaneous arrival of multiple aerial vehicles is considered. By using a time-scale separation principle, one is able to adopt standard Laplacian control to this consensus problem, which is neither unconstrained, nor first order.</p><p>Direct methods for trajectory optimization are traditionally based on<i> a</i> <i>priori </i>temporal discretization and collocation methods. In the second paper, the problem of adaptive node distribution is formulated as a constrained optimization problem, which is to be included in the underlying nonlinear mathematical programming problem. The benefits of utilizing the suggested method for online trajectory optimization are illustrated by a missile guidance example.</p><p>In the third paper, the problem of active observer design for an important class of non-uniformly observable systems, namely mobile robotics systems, is considered. The set of feasible configurations and the set of output flow equivalent states are defined. It is shown that the inter-relation between these two sets may serve as the basis for design of active observers. The proposed observer design methodology is illustrated by considering a unicycle robot model, equipped with a set of range-measuring sensors.</p><p>Finally, in the fourth paper, a geometrically intrinsic observer for Euler-Lagrange systems is defined and analyzed. This observer is a generalization of the observer recently proposed by Aghannan and Rouchon. Their contractivity result is reproduced and complemented by a proof that the region of contraction is infinitely thin. However, assuming <i>a</i> <i>priori </i>bounds on the velocities, convergence of the observer is shown by means of Lyapunov's direct method in the case of configuration manifolds with constant curvature.</p>