809 resultados para Autonomous solutions
Resumo:
Recent developments in automation, robotics and artificial intelligence have given a push to a wider usage of these technologies in recent years, and nowadays, driverless transport systems are already state-of-the-art on certain legs of transportation. This has given a push for the maritime industry to join the advancement. The case organisation, AAWA initiative, is a joint industry-academia research consortium with the objective of developing readiness for the first commercial autonomous solutions, exploiting state-of-the-art autonomous and remote technology. The initiative develops both autonomous and remote operation technology for navigation, machinery, and all on-board operating systems. The aim of this study is to develop a model with which to estimate and forecast the operational costs, and thus enable comparisons between manned and autonomous cargo vessels. The building process of the model is also described and discussed. Furthermore, the model’s aim is to track and identify the critical success factors of the chosen ship design, and to enable monitoring and tracking of the incurred operational costs as the life cycle of the vessel progresses. The study adopts the constructive research approach, as the aim is to develop a construct to meet the needs of a case organisation. Data has been collected through discussions and meeting with consortium members and researchers, as well as through written and internal communications material. The model itself is built using activity-based life cycle costing, which enables both realistic cost estimation and forecasting, as well as the identification of critical success factors due to the process-orientation adopted from activity-based costing and the statistical nature of Monte Carlo simulation techniques. As the model was able to meet the multiple aims set for it, and the case organisation was satisfied with it, it could be argued that activity-based life cycle costing is the method with which to conduct cost estimation and forecasting in the case of autonomous cargo vessels. The model was able to perform the cost analysis and forecasting, as well as to trace the critical success factors. Later on, it also enabled, albeit hypothetically, monitoring and tracking of the incurred costs. By collecting costs this way, it was argued that the activity-based LCC model is able facilitate learning from and continuous improvement of the autonomous vessel. As with the building process of the model, an individual approach was chosen, while still using the implementation and model building steps presented in existing literature. This was due to two factors: the nature of the model and – perhaps even more importantly – the nature of the case organisation. Furthermore, the loosely organised network structure means that knowing the case organisation and its aims is of great importance when conducting a constructive research.
Resumo:
Trabalho de Final de Mestrado para obtenção do grau de Mestre em Engenharia Informática e de Computadores
Resumo:
In this paper we discuss the existence of alpha-Holder classical solutions for non-autonomous abstract partial neutral functional differential equations. An application is considered.
Resumo:
In this paper we discuss the existence of mild and classical solutions for a class of abstract non-autonomous neutral functional differential equations. An application to partial neutral differential equations is considered.
Resumo:
We start by studying the existence of positive solutions for the differential equation u '' = a(x)u - g(u), with u ''(0) = u(+infinity) = 0, where a is a positive function, and g is a power or a bounded function. In other words, we are concerned with even positive homoclinics of the differential equation. The main motivation is to check that some well-known results concerning the existence of homoclinics for the autonomous case (where a is constant) are also true for the non-autonomous equation. This also motivates us to study the analogous fourth-order boundary value problem {u((4)) - cu '' + a(x)u = vertical bar u vertical bar(p-1)u u'(0) = u'''(0) = 0, u(+infinity) = u'(+infinity) = 0 for which we also find nontrivial (and, in some instances, positive) solutions.
Resumo:
Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores
Resumo:
Dissertação para obtenção do Grau de Mestre em Engenharia Eletrotécnica e de Computadores
Resumo:
Tese de Doutoramento Programa Doutoral em Engenharia Electrónica e Computadores
Resumo:
We study the existence of periodic solutions of the non--autonomous periodic Lyness' recurrence u_{n+2}=(a_n+u_{n+1})/u_n, where {a_n} is a cycle with positive values a,b and with positive initial conditions. It is known that for a=b=1 all the sequences generated by this recurrence are 5-periodic. We prove that for each pair (a,b) different from (1,1) there are infinitely many initial conditions giving rise to periodic sequences, and that the family of recurrences have almost all the even periods. If a is not equal to b, then any odd period, except 1, appears.
Resumo:
Current research describes digital innovation largely similar to product innovation. Digital innovation is seen as an object of coherent activities, however in reality digital innovation results from convergence of variant technologies and those related actors with versatile business goals. To account for the dynamic nature of digital innovation, this study applies a service perspective to digital innovation. The purpose of the study is to understand how digital innovation emerges within a service ecosystem for autonomous shipping. The sub-objectives of this study are to 1) identify what factors motivate and demotivate actors to integrate resources for autonomous shipping, 2) explore the key technology areas to be integrated to realise the autonomous shipping concept, and 3) suggest how the technology areas are combined for mutual value creation within a service eco-system for autonomous shipping. Insights from autonomous driving were also included. This study draws on literatures on service innovation and service-dominant logic. The research was conducted as a qualitative exploratory case study. The data comprise interviews of 18 marine and automotive industry experts, 4 workshops, 4 seminars, and observations as well as various secondary data sources. The findings revealed that the key actors have versatile motivations regarding autonomous shipping. These varied from opportunities for single applications to occupying a central role in an autonomous technology platform. Thus, autonomous shipping can be seen as an umbrella concept comprising multiple levels. In technical terms, the development of the concept of autonomous shipping is largely based on combining existing technology solutions, which are gradually integrated towards more systemic entities comprising areas of the autonomous shipping concept. This study argues that a service perspective embraces the inherently complex and dynamic nature of digital innovation. This is captured in the developed research framework that describes digital innovation emerging on different levels of interaction: 1. strategic relationships for new solutions, 2. new local networks for technology platforms, and 3. global networks for new markets. The framework shows how the business models and motivations of digital innovation actors feed the emergence of digital innovation in overlapping service ecosystems that together comprise an innovation ecosystem for autonomous technologies. Digital innovation managers will benefit from seeing their businesses as part of a larger ecosystem of value co-creating actors. In orchestrating digital innovation within a service ecosystem, it is suggested that managers consider the resources, roles and institutions within the ecosystem. Finally, as autonomous shipping is at its infancy, the topic provides a number of interesting avenues for future research.
Resumo:
Les objets d’étude de cette thèse sont les systèmes d’équations quasilinéaires du premier ordre. Dans une première partie, on fait une analyse du point de vue du groupe de Lie classique des symétries ponctuelles d’un modèle de la plasticité idéale. Les écoulements planaires dans les cas stationnaire et non-stationnaire sont étudiés. Deux nouveaux champs de vecteurs ont été obtenus, complétant ainsi l’algèbre de Lie du cas stationnaire dont les sous-algèbres sont classifiées en classes de conjugaison sous l’action du groupe. Dans le cas non-stationnaire, une classification des algèbres de Lie admissibles selon la force choisie est effectuée. Pour chaque type de force, les champs de vecteurs sont présentés. L’algèbre ayant la dimension la plus élevée possible a été obtenues en considérant les forces monogéniques et elle a été classifiée en classes de conjugaison. La méthode de réduction par symétrie est appliquée pour obtenir des solutions explicites et implicites de plusieurs types parmi lesquelles certaines s’expriment en termes d’une ou deux fonctions arbitraires d’une variable et d’autres en termes de fonctions elliptiques de Jacobi. Plusieurs solutions sont interprétées physiquement pour en déduire la forme de filières d’extrusion réalisables. Dans la seconde partie, on s’intéresse aux solutions s’exprimant en fonction d’invariants de Riemann pour les systèmes quasilinéaires du premier ordre. La méthode des caractéristiques généralisées ainsi qu’une méthode basée sur les symétries conditionnelles pour les invariants de Riemann sont étendues pour être applicables à des systèmes dans leurs régions elliptiques. Leur applicabilité est démontrée par des exemples de la plasticité idéale non-stationnaire pour un flot irrotationnel ainsi que les équations de la mécanique des fluides. Une nouvelle approche basée sur l’introduction de matrices de rotation satisfaisant certaines conditions algébriques est développée. Elle est applicable directement à des systèmes non-homogènes et non-autonomes sans avoir besoin de transformations préalables. Son efficacité est illustrée par des exemples comprenant un système qui régit l’interaction non-linéaire d’ondes et de particules. La solution générale est construite de façon explicite.
Resumo:
Simultaneous Localization and Mapping (SLAM) do not result in consistent maps of large areas because of gradual increase of the uncertainty for long term missions. In addition, as the size of the map grows the computational cost increases, making SLAM solutions unsuitable for on-line applications. This thesis surveys SLAM approaches paying special attention to those approaches aimed to work on large scenarios. Special focus is given to existing underwater SLAM applications. A technique based on using independent local maps together with a global stochastic map is presented. This technique is called Selective Submap Joining SLAM (SSJS). A global map contains relative transformations between local maps, which are updated once a new loop is detected. Maps sharing several features are fused, maintaining the correlation between landmarks and vehicle's pose. The use of local maps reduces computational costs and improves map consistency as compared to state of the art techniques.
Resumo:
This note investigates the motion control of an autonomous underwater vehicle (AUV). The AUV is modeled as a nonholonomic system as any lateral motion of a conventional, slender AUV is quickly damped out. The problem is formulated as an optimal kinematic control problem on the Euclidean Group of Motions SE(3), where the cost function to be minimized is equal to the integral of a quadratic function of the velocity components. An application of the Maximum Principle to this optimal control problem yields the appropriate Hamiltonian and the corresponding vector fields give the necessary conditions for optimality. For a special case of the cost function, the necessary conditions for optimality can be characterized more easily and we proceed to investigate its solutions. Finally, it is shown that a particular set of optimal motions trace helical paths. Throughout this note we highlight a particular case where the quadratic cost function is weighted in such a way that it equates to the Lagrangian (kinetic energy) of the AUV. For this case, the regular extremal curves are constrained to equate to the AUV's components of momentum and the resulting vector fields are the d'Alembert-Lagrange equations in Hamiltonian form.
Resumo:
Abu-Saris and DeVault proposed two open problems about the difference equation x(n+1) = a(n)x(n)/x(n-1), n = 0, 1, 2,..., where a(n) not equal 0 for n = 0, 1, 2..., x(-1) not equal 0, x(0) not equal 0. In this paper we provide solutions to the two open problems. (c) 2004 Elsevier Inc. All rights reserved.
Resumo:
Classical measures of network connectivity are the number of disjoint paths between a pair of nodes and the size of a minimum cut. For standard graphs, these measures can be computed efficiently using network flow techniques. However, in the Internet on the level of autonomous systems (ASs), referred to as AS-level Internet, routing policies impose restrictions on the paths that traffic can take in the network. These restrictions can be captured by the valley-free path model, which assumes a special directed graph model in which edge types represent relationships between ASs. We consider the adaptation of the classical connectivity measures to the valley-free path model, where it is -hard to compute them. Our first main contribution consists of presenting algorithms for the computation of disjoint paths, and minimum cuts, in the valley-free path model. These algorithms are useful for ASs that want to evaluate different options for selecting upstream providers to improve the robustness of their connection to the Internet. Our second main contribution is an experimental evaluation of our algorithms on four types of directed graph models of the AS-level Internet produced by different inference algorithms. Most importantly, the evaluation shows that our algorithms are able to compute optimal solutions to instances of realistic size of the connectivity problems in the valley-free path model in reasonable time. Furthermore, our experimental results provide information about the characteristics of the directed graph models of the AS-level Internet produced by different inference algorithms. It turns out that (i) we can quantify the difference between the undirected AS-level topology and the directed graph models with respect to fundamental connectivity measures, and (ii) the different inference algorithms yield topologies that are similar with respect to connectivity and are different with respect to the types of paths that exist between pairs of ASs.