Literatura científica selecionada sobre o tema "Multi-Task Optimisation"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Multi-Task Optimisation".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Multi-Task Optimisation"
1
Pearce, Michael, e Juergen Branke. "Continuous multi-task Bayesian Optimisation with correlation". European Journal of Operational Research 270, n.º 3 (novembro de 2018): 1074–85. http://dx.doi.org/10.1016/j.ejor.2018.03.017.
Texto completo da fonte
2
Li, Feng, Lin Zhang, T. W. Liao e Yongkui Liu. "Multi-objective optimisation of multi-task scheduling in cloud manufacturing". International Journal of Production Research 57, n.º 12 (8 de novembro de 2018): 3847–63. http://dx.doi.org/10.1080/00207543.2018.1538579.
Texto completo da fonte
3
Panchu K., Padmanabhan, M. Rajmohan, R. Sundar e R. Baskaran. "Multi-objective Optimisation of Multi-robot Task Allocation with Precedence Constraints". Defence Science Journal 68, n.º 2 (13 de março de 2018): 175. http://dx.doi.org/10.14429/dsj.68.11187.
Texto completo da fonteResumo:
Efficacy of the multi-robot systems depends on proper sequencing and optimal allocation of robots to the tasks. Focuses on deciding the optimal allocation of set-of-robots to a set-of-tasks with precedence constraints considering multiple objectives. Taguchi’s design of experiments based parameter tuned genetic algorithm (GA) is developed for generalised task allocation of single-task robots to multi-robot tasks. The developed methodology is tested for 16 scenarios by varying the number of robots and number of tasks. The scenarios were tested in a simulated environment with a maximum of 20 robots and 40 multi-robot foraging tasks. The tradeoff between performance measures for the allocations obtained through GA for different task levels was used to decide the optimal number of robots. It is evident that the tradeoffs occur at 20 per cent of performance measures and the optimal number of robot varies between 10 and 15 for almost all the task levels. This method shows good convergence and found that the precedence constraints affect the optimal number of robots required for a particular task level.
4
Bellotti, Renato, Romana Boiger e Andreas Adelmann. "Fast, Efficient and Flexible Particle Accelerator Optimisation Using Densely Connected and Invertible Neural Networks". Information 12, n.º 9 (28 de agosto de 2021): 351. http://dx.doi.org/10.3390/info12090351.
Texto completo da fonteResumo:
Particle accelerators are enabling tools for scientific exploration and discovery in various disciplines. However, finding optimised operation points for these complex machines is a challenging task due to the large number of parameters involved and the underlying non-linear dynamics. Here, we introduce two families of data-driven surrogate models, based on deep and invertible neural networks, that can replace the expensive physics computer models. These models are employed in multi-objective optimisations to find Pareto optimal operation points for two fundamentally different types of particle accelerators. Our approach reduces the time-to-solution for a multi-objective accelerator optimisation up to a factor of 640 and the computational cost up to 98%. The framework established here should pave the way for future online and real-time multi-objective optimisation of particle accelerators.
5
Cvetkovski, Goga, e Lidija Petkovska. "Design Improvement of Permanent Magnet Motor Using Single- and Multi-Objective Approaches". Power Electronics and Drives 9, n.º 1 (1 de janeiro de 2024): 34–49. http://dx.doi.org/10.2478/pead-2024-0003.
Texto completo da fonteResumo:
Abstract Optimisation, or optimal design, has become a fundamental aspect of engineering across various domains, including power devices, power systems, and industrial systems. Engineers and academics have been actively involved in optimising these systems to achieve better performance, efficiency, and cost-effectiveness. Optimising electrical machines, including permanent magnet motors, is a complex task. It often involves solving intricate problems with various parameters and constraints. Engineers use different optimisation methods to tackle these challenges. Depending on the specific requirements and goals of a design project, engineers may employ either single-objective or multi-objective optimisation approaches. Single-objective optimisation focuses on optimising a single objective, while multi-objective optimisation considers multiple conflicting objectives. In optimisation, objective functions are mathematical representations of what needs to be optimised. In this case, optimising the efficiency of the motor, reducing cogging torque, and minimising the total weight of active materials are defined as possible objective functions. Genetic algorithms are nature based algorithms that are commonly used in engineering to find optimal solutions to complex problems, including those with multiple objectives. In this paper, after conducting optimisations using different objective functions and methods, a comparative analysis of the results is performed. This helps in understanding the trade-offs and benefits of different design choices. Finite element analysis (FEA) is a computational method used to analyse the physical properties and behaviours of complex structures and systems. In this case, FEA is used to validate and analyse selected optimisation solutions to ensure they meet the desired characteristics and parameters. Overall, this work demonstrates the interdisciplinary nature of engineering, where mathematics, computer science (for optimisation algorithms), and physics (for FEA) converge to improve the performance and efficiency of electrical machines. It also underscores the importance of considering multiple objectives in design processes to find optimal solutions that strike a balance between competing goals.
6
Trianni, Vito, e Manuel López-Ibáñez. "Advantages of Task-Specific Multi-Objective Optimisation in Evolutionary Robotics". PLOS ONE 10, n.º 8 (21 de agosto de 2015): e0136406. http://dx.doi.org/10.1371/journal.pone.0136406.
Texto completo da fonte
7
Ramachandram, S., e Prashant Balkrishna Jawade. "Task scheduling in multi-cloud environment via improved optimisation theory". International Journal of Wireless and Mobile Computing 27, n.º 1 (2024): 64–77. http://dx.doi.org/10.1504/ijwmc.2024.10064647.
Texto completo da fonte
8
Jawade, Prashant Balkrishna, e S. Ramachandram. "Task scheduling in multi-cloud environment via improved optimisation theory". International Journal of Wireless and Mobile Computing 27, n.º 1 (2024): 64–77. http://dx.doi.org/10.1504/ijwmc.2024.139671.
Texto completo da fonte
9
Lisowski, Józef. "Multi-Criteria Optimisation of Multi-Stage Positional Game of Vessels". Polish Maritime Research 27, n.º 1 (1 de março de 2020): 46–52. http://dx.doi.org/10.2478/pomr-2020-0005.
Texto completo da fonteResumo:
AbstractThe paper presents a mathematical model of a positional game of the safe control of a vessel in collision situations at sea, containing a description of control, state variables and state constraints as well as sets of acceptable ship strategies, as a multi-criteria optimisation task. The three possible tasks of multi-criteria optimisation were formulated in the form of non-cooperative and cooperative multi-stage positional games as well as optimal non-game controls. The multi-criteria control algorithms corresponding to these tasks were subjected to computer simulation in Matlab/Simulink software based on the example of the real navigational situation of the passing of one’s own vessel with eighteen objects encountered in the North Sea.
10
Goddanti, N. S. S. L. Venkata Jwala, Pooja Ponakampalli, Shiny Sharon Neela, Reashma Sulthana Shaik e V. Suresh Chintalapudi. "An OptiAssign-PSO based optimisation for multi-objective multi-level multi-task scheduling in cloud computing environment". i-manager’s Journal on Cloud Computing 11, n.º 1 (2024): 1. http://dx.doi.org/10.26634/jcc.11.1.20484.
Texto completo da fonteResumo:
Cloud computing is a prominent and evolving distributed computing paradigm that provides users with on-demand services through a network of diverse autonomous systems with flexible computational structures. The significance of task scheduling becomes evident, serving as a vital component to elevating cloud computing's overall performance. Streamlining cost-effective execution and optimizing resource utilization is a key objective, given the NP-hard nature of the task scheduling problem. Although numerous meta-heuristic techniques have been explored to address task allocation challenges, ample opportunities remain for the development of optimal strategies. This paper presents a state-of-the-art task assignment model that revolves around OptiAssign particle swarm optimization (PSO), with a strong emphasis on the crucial role played by efficient dependency handling and multi-level task scheduling. The primary aim of this model is to optimize the utilization of virtual machine capacities, simultaneously minimizing execution time, makespan, wait time, and overall execution costs within a variety of distributed computing systems. This novel algorithm showcases outstanding performance when compared to traditional approaches in task scheduling, highlighting the importance of skillful dependency management and the implementation of multi-level task scheduling strategies. The results of this study further affirm the effectiveness of the model in addressing the inherent complexities of scenarios involving intricate task dependencies and diverse scheduling priorities.
Teses / dissertações sobre o assunto "Multi-Task Optimisation"
1
Turner, Joanna. "Distributed task allocation optimisation techniques in multi-agent systems". Thesis, Loughborough University, 2018. https://dspace.lboro.ac.uk/2134/36202.
Texto completo da fonteResumo:
A multi-agent system consists of a number of agents, which may include software agents, robots, or even humans, in some application environment. Multi-robot systems are increasingly being employed to complete jobs and missions in various fields including search and rescue, space and underwater exploration, support in healthcare facilities, surveillance and target tracking, product manufacturing, pick-up and delivery, and logistics. Multi-agent task allocation is a complex problem compounded by various constraints such as deadlines, agent capabilities, and communication delays. In high-stake real-time environments, such as rescue missions, it is difficult to predict in advance what the requirements of the mission will be, what resources will be available, and how to optimally employ such resources. Yet, a fast response and speedy execution are critical to the outcome. This thesis proposes distributed optimisation techniques to tackle the following questions: how to maximise the number of assigned tasks in time restricted environments with limited resources; how to reach consensus on an execution plan across many agents, within a reasonable time-frame; and how to maintain robustness and optimality when factors change, e.g. the number of agents changes. Three novel approaches are proposed to address each of these questions. A novel algorithm is proposed to reassign tasks and free resources that allow the completion of more tasks. The introduction of a rank-based system for conflict resolution is shown to reduce the time for the agents to reach consensus while maintaining equal number of allocations. Finally, this thesis proposes an adaptive data-driven algorithm to learn optimal strategies from experience in different scenarios, and to enable individual agents to adapt their strategy during execution. A simulated rescue scenario is used to demonstrate the performance of the proposed methods compared with existing baseline methods.
2
Pascal, Lucas. "Optimization of deep multi-task networks". Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS535.
Texto completo da fonteResumo:
L'apprentissage multi-tâches est un paradigme d'apprentissage impliquant l’optimisation de paramètres par rapport à plusieurs tâches simultanément. En apprenant plusieurs tâches liées, un modèle d'apprentissage dispose d'un ensemble d'informations plus complet concernant le domaine dont les tâches sont issues, lui permettant ainsi de construire un meilleur ensemble d’hypothèse sur ce domaine. Cependant, en pratique, les gains de performance obtenus par les réseaux multi-tâches sont loin d'être systématiques. Il arrive au contraire que ces réseaux subissent une perte de performance liée à des phénomènes d’interférences entre les différentes tâches. Cette thèse traite du problème d'interférences en apprentissage multi-tâches, afin d'améliorer les capacités de généralisation des réseaux de neurones profondsMulti-task learning (MTL) is a learning paradigm involving the joint optimization of parameters with respect to multiple tasks. By learning multiple related tasks, a learner receives more complete and complementary information on the input domain from which the tasks are issued. This allows to gain better understanding of the domain by building a more accurate set of assumptions of it. However, in practice, the broader use of MTL is hindered by the lack of consistent performance gains observed by deep multi-task networks. It is often the case that deep MTL networks suffer from performance degradation caused by task interference. This thesis addresses the problem of task interference in Multi-Task learning, in order to improve the generalization capabilities of deep neural networks
3
Anne, Timothée. "L'optimisation multi-tâche et ses applications à la robotique : d'abord résoudre, ensuite généraliser". Electronic Thesis or Diss., Université de Lorraine, 2024. http://www.theses.fr/2024LORR0045.
Texto completo da fonteResumo:
Doter des agents artificiels, tels que des robots, d'une capacité à apprendre à réaliser des tâches complexes et à s'adapter est une quête centrale de la recherche en intelligence artificielle. L'apprentissage par renforcement profond en est aujourd'hui une des méthodes privilégiées, mais n'est ni toujours simple à mettre en œuvre, ni toujours la plus performante. Dans cette thèse, nous étudions un autre concept d'apprentissage de politique qui se divise en deux étapes : une étape de résolution d'un ensemble de sous-problèmes puis une étape de généralisation. Plus formellement, la première étape reformule le problème général comme un problème multi-tâche permettant d'obtenir un jeu de données de solutions. La seconde étape utilise de l'apprentissage supervisé sur ce jeu de données pour entraîner une politique générale. Nous évaluons d'abord la viabilité de ce concept à un problème d'apprentissage de réflexes d'évitement de chute avec un robot humanoïde réel. Non seulement il permet d'apprendre des comportements en simulation qui permettent d'éviter la chute dans plus de 75% des cas, mais ces comportements sont assez robustes pour fonctionner sur le robot réel. Nous développons ensuite un algorithme de qualité-diversité multi-tâche, Multi-Task Multi-Behavior MAP-Elites, pour améliorer l'efficacité d'échantillonnage de la première étape de résolution. Nous illustrons cet algorithme sur le même problème d'apprentissage de réflexes d'évitement de chute d'un robot humanoïde et pour généraliser à des environnements plus réalistes. Nous proposons enfin de passer d'une étape de résolution discrète à une résolution continue. Pour ce faire, nous reformulons le problème d'optimisation multi-tâche boîte noire comme un problème d'optimisation paramétrique et proposons une méthode pour le résoudre : Parametric-Task MAP-Elites. Parametric-Task MAP-Elites résout une nouvelle tâche à chaque itération, recouvrant asymptotiquement l'espace des tâches. Après avoir consommé son budget d'évaluations, Parametric-Task MAP-Elites distille les solutions trouvées dans une politique pour généraliser à l'ensemble de l'espace continu. L'optimisation multi-tâche est une méthode sous-exploitée qui montre, dans cette thèse, son aptitude à permettre de résoudre certains problèmes de robotique de façon plus simple à mettre en œuvre et plus performante que l'apprentissage par renforcement profondGranting artificial agents, such as robots, the capability to learn how to solve complex tasks and adapt is a central quest in artificial intelligence research. Today, reinforcement learning is favored, but it is neither straightforward to implement nor consistently effective. In this thesis, we explore an alternative policy learning concept divided into two stages: solving a set of sub-problems and generalization. More formally, the first stage reformulates the general problem into a multi-task problem to obtain a dataset of high-performing solutions. The second stage applies supervised learning to this dataset to train a general policy. We first evaluate the viability of this concept in learning fall avoidance reflexes with a real humanoid robot. It enables learning behaviors in simulation that prevent falling in more than 75% % of cases, and these behaviors are robust enough to function on the real robot. We then develop a multi-task multi-behavior quality-diversity algorithm, Multi-Task Multi-Behavior MAP-Elites, to improve the sample efficiency of the first resolution stage. We demonstrate its application in fall avoidance reflex learning, where it performs better than a deep reinforcement learning algorithm and also enables generalization to more realistic environments. Finally, we propose to go from a discrete resolution stage to a continuous resolution stage. To do so, we reformulate the multi-task black-box optimization problem as a parametric optimization problem and propose a method to solve it: Parametric-Task MAP-Elites. Parametric-Task MAP-Elites solves a new task at each iteration, asymptotically covering the task space. After consuming its evaluation budget, Parametric-Task MAP-Elites distills the solutions found into a policy to generalize to the entire continuous space. Multi-task optimization is an underexploited method that has demonstrated in this thesis its ability to solve some robotics problems more straightforwardly and effectively than deep reinforcement learning
4
Rommel, Cédric. "Exploration de données pour l'optimisation de trajectoires aériennes". Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLX066/document.
Texto completo da fonteResumo:
Cette thèse porte sur l'utilisation de données de vols pour l'optimisation de trajectoires de montée vis-à-vis de la consommation de carburant.Dans un premier temps nous nous sommes intéressé au problème d'identification de modèles de la dynamique de l'avion dans le but de les utiliser pour poser le problème d'optimisation de trajectoire à résoudre. Nous commençont par proposer une formulation statique du problème d'identification de la dynamique. Nous l'interpretons comme un problème de régression multi-tâche à structure latente, pour lequel nous proposons un modèle paramétrique. L'estimation des paramètres est faite par l'application de quelques variations de la méthode du maximum de vraisemblance.Nous suggérons également dans ce contexte d'employer des méthodes de sélection de variable pour construire une structure de modèle de régression polynomiale dépendant des données. L'approche proposée est une extension à un contexte multi-tâche structuré du bootstrap Lasso. Elle nous permet en effet de sélectionner les variables du modèle dans un contexte à fortes corrélations, tout en conservant la structure du problème inhérente à nos connaissances métier.Dans un deuxième temps, nous traitons la caractérisation des solutions du problème d'optimisation de trajectoire relativement au domaine de validité des modèles identifiés. Dans cette optique, nous proposons un critère probabiliste pour quantifier la proximité entre une courbe arbitraire et un ensemble de trajectoires échantillonnées à partir d'un même processus stochastique. Nous proposons une classe d'estimateurs de cette quantitée et nous étudions de façon plus pratique une implémentation nonparamétrique basé sur des estimateurs à noyau, et une implémentation paramétrique faisant intervenir des mélanges Gaussiens. Ce dernier est introduit comme pénalité dans le critère d'optimisation de trajectoire dans l'objectif l'intention d'obtenir directement des trajectoires consommant peu sans trop s'éloigner des régions de validitéThis thesis deals with the use of flight data for the optimization of climb trajectories with relation to fuel consumption.We first focus on methods for identifying the aircraft dynamics, in order to plug it in the trajectory optimization problem. We suggest a static formulation of the identification problem, which we interpret as a structured multi-task regression problem. In this framework, we propose parametric models and use different maximum likelihood approaches to learn the unknown parameters.Furthermore, polynomial models are considered and an extension to the structured multi-task setting of the bootstrap Lasso is used to make a consistent selection of the monomials despite the high correlations among them.Next, we consider the problem of assessing the optimized trajectories relatively to the validity region of the identified models. For this, we propose a probabilistic criterion for quantifying the closeness between an arbitrary curve and a set of trajectories sampled from the same stochastic process. We propose a class of estimators of this quantity and prove their consistency in some sense. A nonparemetric implementation based on kernel density estimators, as well as a parametric implementation based on Gaussian mixtures are presented. We introduce the later as a penalty term in the trajectory optimization problem, which allows us to control the trade-off between trajectory acceptability and consumption reduction
5
Koung, Daravuth. "Cooperative navigation of a fleet of mobile robots". Electronic Thesis or Diss., Ecole centrale de Nantes, 2022. http://www.theses.fr/2022ECDN0044.
Texto completo da fonteResumo:
L’intérêt pour l’intégration des systèmes multi-robots (MRS) dans les applications du monde réel augmente de plus en plus, notamment pour l’exécution de tâches complexes. Pour les tâches de transport de charges, différentes stratégies de manutention de charges ont été proposées telles que : la poussée seule, la mise en cage et la préhension. Dans cette thèse, nous souhaitons utiliser une stratégie de manipulation simple : placer l’objet à transporter au sommet d’un groupe de robots mobiles. Ainsi, cela nécessite un contrôle de formation rigide. Nous proposons deux algorithmes de formation. L’algorithme de consensus est l’un d’entre eux. Nous adaptons un contrôleur de flocking dynamique pour qu’il soit utilisé dans le système à un seul intégrateur, et nous proposons un système d’évitement d’obstacles qui peut empêcher le fractionnement tout en évitant les obstacles. Le deuxième contrôle de formation est basé sur l’optimisation quadratique hiérarchique (HQP). Le problème est décomposé en plusieurs objectifs de tâches : formation, navigation,évitement d’obstacles et limites de vitesse. Ces tâches sont représentées par des contraintes d’égalité et d’inégalité avec différentsniveaux de priorité, qui sont résolues séquentiellement par le HQP. Enfin, une étude sur les algorithmes d’allocation des tâches(Contract Net Protocol et Tabu Search) est menée afin de déterminer une solution appropriée pour l’allocation des tâches dans l’environnementindustrielThe interest in integrating multirobot systems (MRS) into real-world applications is increasing more and more, especially for performing complex tasks. For loadcarrying tasks, various load-handling strategies have been proposed such as: pushingonly, caging, and grasping. In this thesis, we aim to use a simple handling strategy: placing the carrying object on top of a group of wheeled mobile robots. Thus, it requires a rigid formation control. A consensus algorithm is one of the two formation controllers we apply to the system. We adapt a dynamic flocking controller to be used in the singleintegrator system, and we propose an obstacle avoidance that can prevent splitting while evading the obstacles. The second formation control is based on hierarchical quadratic programming (HQP). The problem is decomposed into multiple task objectives: formation, navigation, obstacle avoidance, velocity limits. These tasks are represented by equality and inequality constraints with different levels of priority, which are solved sequentially by the HQP. Lastly, a study on task allocation algorithms (Contract Net Protocol and Tabu Search) is carried out in order to determine an appropriate solution for allocating tasks in the industrial environment
6
Gou, Changjiang. "Task Mapping and Load-balancing for Performance, Memory, Reliability and Energy". Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEN047.
Texto completo da fonteResumo:
Cette thèse se concentre sur les problèmes d'optimisation multi-objectifs survenant lors de l'exécution d'applications scientifiques sur des plates-formes de calcul haute performance et des applications de streaming sur des systèmes embarqués. Ces problèmes d'optimisation se sont tous avérés NP-complets, c'est pourquoi nos efforts portent principalement sur la conception d'heuristiques efficaces pour des cas généraux et sur la proposition de solutions optimales pour des cas particuliers.Certaines applications scientifiques sont généralement modélisées comme des arbres enracinés. En raison de la taille des données temporaires, le traitement d'une telle arborescence peut dépasser la capacité de la mémoire locale. Une solution pratique sur un système multiprocesseur consiste à partitionner l'arborescence en plusieurs sous-arbres, et à exécuter chacun d'eux sur un processeur, qui est équipé d'une mémoire locale. Nous avons étudié comment partitionner l'arbre en plusieurs sous-arbres de sorte que chaque sous-arbre tienne dans la mémoire locale et que le makespan soit minimisé, lorsque les coûts de communication entre les processeurs sont pris en compte. Ensuite, un travail pratique d'ordonnancement d'arbres apparaissant dans un solveur de matrice clairsemée parallèle est examiné. L'objectif est de minimiser le temps de factorisation en présentant une bonne localisation des données et un équilibrage de charge. La technique de cartographie proportionnelle est une approche largement utilisée pour résoudre ce problème d'allocation des ressources. Il réalise une bonne localisation des données en affectant les mêmes processeurs à de grandes parties de l'arborescence des tâches. Cependant, cela peut limiter l'équilibrage de charge dans certains cas. Basé sur une cartographie proportionnelle, un algorithme d'ordonnancement dynamique est proposé. Il assouplit le critère de localisation des données pour améliorer l'équilibrage de charge. La performance de notre approche a été validée par de nombreuses expériences avec le solveur direct à matrice clairsemée parallèle PaStiX. Les applications de streaming apparaissent souvent dans les domaines vidéo et audio. Ils se caractérisent par une série d'opérations sur le streaming de données et un débit élevé. Le système multiprocesseur sur puce (MPSoC) est un système embarqué multi / plusieurs cœurs qui intègre de nombreux cœurs spécifiques via une interconnexion haute vitesse sur une seule puce. De tels systèmes sont largement utilisés pour les applications multimédias. De nombreux MPSoC fonctionnent sur piles. Un budget énergétique aussi serré nécessite intrinsèquement un calendrier efficace pour répondre aux demandes de calcul intensives. La mise à l'échelle dynamique de la tension et de la fréquence (DVFS) peut économiser de l'énergie en diminuant la fréquence et la tension au prix d'une augmentation des taux de défaillance. Une autre technique pour réduire le coût énergétique et atteindre l'objectif de fiabilité consiste à exécuter plusieurs copies de tâches. Nous modélisons d'abord les applications sous forme de chaînes linéaires et étudions comment minimiser la consommation d'énergie sous des contraintes de débit et de fiabilité, en utilisant DVFS et la technique de duplication sur les plates-formes MPSoC.Ensuite, dans une étude suivante, avec le même objectif d'optimisation, nous modélisons les applications de streaming sous forme de graphes série-parallèle, plus complexes que de simples chaînes et plus réalistes. La plate-forme cible dispose d'un système de communication hiérarchique à deux niveaux, ce qui est courant dans les systèmes embarqués et les plates-formes informatiques hautes performances. La fiabilité est garantie par l'exécution des tâches à la vitesse maximale ou par la triplication des tâches. Plusieurs heuristiques efficaces sont proposées pour résoudre ce problème d'optimisation NP-completThis thesis focuses on multi-objective optimization problems arising when running scientific applications on high performance computing platforms and streaming applications on embedded systems. These optimization problems are all proven to be NP-complete, hence our efforts are mainly on designing efficient heuristics for general cases, and proposing optimal solutions for special cases.Some scientific applications are commonly modeled as rooted trees. Due to the size of temporary data, processing such a tree may exceed the local memory capacity. A practical solution on a multiprocessor system is to partition the tree into many subtrees, and run each on a processor, which is equipped with a local memory. We studied how to partition the tree into several subtrees such that each subtree fits in local memory and the makespan is minimized, when communication costs between processors are accounted for.Then, a practical work of tree scheduling arising in parallel sparse matrix solver is examined. The objective is to minimize the factorization time by exhibiting good data locality and load balancing. The proportional mapping technique is a widely used approach to solve this resource-allocation problem. It achieves good data locality by assigning the same processors to large parts of the task tree. However, it may limit load balancing in some cases. Based on proportional mapping, a dynamic scheduling algorithm is proposed. It relaxes the data locality criterion to improve load balancing. The performance of our approach has been validated by extensive experiments with the parallel sparse matrix direct solver PaStiX.Streaming applications often appear in video and audio domains. They are characterized by a series of operations on streaming data, and a high throughput. Multi-Processor System on Chip (MPSoC) is a multi/many-core embedded system that integrates many specific cores through a high speed interconnect on a single die. Such systems are widely used for multimedia applications. Lots of MPSoCs are batteries-operated. Such a tight energy budget intrinsically calls for an efficient schedule to meet the intensive computation demands. Dynamic Voltage and Frequency Scaling (DVFS) can save energy by decreasing the frequency and voltage at the price of increasing failure rates. Another technique to reduce the energy cost and meet the reliability target consists in running multiple copies of tasks. We first model applications as linear chains and study how to minimize the energy consumption under throughput and reliability constraints, using DVFS and duplication technique on MPSoC platforms.Then, in a following study, with the same optimization goal, we model streaming applications as series-parallel graphs, which are more complex than simple chains and more realistic. The target platform has a hierarchical communication system with two levels, which is common in embedded systems and high performance computing platforms. The reliability is guaranteed through either running tasks at the maximum speed or triplication of tasks. Several efficient heuristics are proposed to tackle this NP-complete optimization problem
7
Touzani, Hicham. "Planification Multi-Robot du Problème de Répartition de Tâches avec Évitement Automatique de Collisions et Optimisation du Temps de Cycle : Application à la Chaîne de Production Automobile". Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPAST079.
Texto completo da fonteResumo:
Dans l’industrie automobile, plusieurs robots sont nécessaires pour réaliser simultanément des séquences de soudage sur un même véhicule. L’attribution et la coordination des tâches de soudage entre les robots est une phase manuelle et exigeante qui doit être optimisée à l’aide d’outils automatiques. Le temps de cycle de la cellule dépend fortement de différents facteurs robotiques tels que la répartition des tâches entre les robots, les solutions de configuration et l’évitement d’obstacles. De plus, un aspect clé, souvent négligé dans l’état de l’art, est de définir une stratégie pour résoudre le séquencement des tâches robotiques avec une intégration efficace de l’évitement de collisions robot-robot. Cette thèse est motivée par la résolution de ce problème industriel et cherche à relever différents défis de recherche. Elle commence par présenter les solutions de pointe actuelles en matière de planification robotique. Une enquête approfondie est menée sur les solutions académiques/industrielles existantes pour résoudre le problème de répartition des tâches robotiques, en particulier pour les systèmes multi-robot. Cette enquête permet d’identifier les défis lors de l’intégration de plusieurs facteurs robotiques dans le processus d’optimisation. Cette thèse présente un algorithme itératif efficace qui génère une solution de haute qualité pour le problème de répartition de tâches multi-robot. Ce dernier gère non seulement les facteurs robotiques mentionnés, mais également les aspects liés aux contraintes d’accessibilité et à l’évitement de collisions mutuelles. De plus, un planificateur fait maison (RoboTSPlanner) gérant des robots à six axes a été validé dans un scénario de cas réel. Afin d’assurer l’exhaustivité de la méthodologie proposée, nous effectuons une optimisation dans l’espace des tâches, de configuration et de coordination de manière synergique. Par rapport aux approches existantes, la simulation comme les expérimentations réelles révèlent des résultats positifs en termes de temps de cycle et montrent la capacité de cette méthode à s’interfacer à la fois avec les logiciels de simulation industrielle et les outils ROS-IIn the automotive industry, several robots are required to simultaneously carry out welding sequences on the same vehicle. Assigning and coordinating welding tasks between robots is a manual and challenging phase that must be optimized using automatic tools. The cycle time of the cell strongly depends on different robotic factors such as the task allocation among the robots, the configuration solutions, and obstacle avoidance. Moreover, a key aspect, often neglected in the state-ofthe- art, is to define a strategy to solve the robotic task sequencing with an effective robot-robot collision avoidance integration. This thesis is motivated by solving this industrial problem and seeks to raise different research challenges. It begins by presenting the current state-of-the-art solutions regarding robotic planning. An in-depth investigation is carried out on the related existing academic/industrial solutions to solve the robotic task sequencing problem, particularly for multi-robot systems. This investigation helps identify the challenges when integrating several robotic factors into the optimization process. An efficient iterative algorithm that generates a high-quality solution for the Multi-Robotic Task Sequencing Problem is presented. This algorithm manages not only the mentioned robotic factors but also aspects related to accessibility constraints and mutual collision avoidance. In addition, a home-developed planner (RoboTSPlanner) handling six-axis robots has been validated in a real case scenario. In order to ensure the completeness of the proposed methodology, we perform optimization in the task, configuration, and coordination space in a synergistic way. Compared to the existing approaches, both simulation and real experiments reveal positive results in terms of cycle time and show the ability of this method to be interfaced with both industrial simulation software and ROS-I tools
8
Vitolo, Ferdinando. "Multi-Attribute Task Sequencing Optimisation with Neighbourhoods for Robotic Systems". Tesi di dottorato, 2017. http://www.fedoa.unina.it/11509/1/PhD-Thesis_Vitolo.pdf.
Texto completo da fonteResumo:
Modern manufacturing processes have to be continuously updated to catch up with fast-evolving requirements, as dictated my competitive and dynamic markets, which demand high product variety. Indeed, in the era of smart factories and cyber-physical production systems (CPPS) we are experiencing a fast transition from mass production to mass customisation. Key Enabling Technologies (KETs) are then necessary to hinge business and market needs on digital solutions which enable the rapid delivery of new and innovative products. If on one side mass customisation imposes high level of product variety, on the other hand customers wish to receive high quality products, which reflect the need for near-zero defects manufacturing systems. Therefore, the combination of macro-level changes (product variety) and micro-level variety (product defects) leads to the concept of self-evolving production systems, one of the KETs to enable CPPS. In this context, industrial robots play a key role to deploy automation and fast responsiveness.
Currently, robots are programmed following off-line methods. Tough those methods are still a premium solution to model and simulate production systems, they suffer the capability to incorporate dynamic changes. Therefore, it is crucial to introduce the new concept of dynamic robot programming which enables real-time robot adjustments. Robot programming usually consists of four steps: (1) task planning; (2) task sequencing; (3) path planning and (4) motion planning. These steps are strictly coupled although robot trajectory is mainly affected by defined tasks. In literature, task sequencing is modelled as Travelling Salesman Problem with Neighbourhoods (TSPN). There exist several methods for solving TSPN, but no one enables the dynamic programming.
This thesis aims to develop robot tasks sequencing methodology with the ultimate goal of finding the near-optimum task sequence, by minimising computational time to enable dynamic robot programming in the case of multiple and coupled tasks’ attributes.
The thesis introduces two methodologies: (1) “Enhanced Heuristic with Hierarchical Clustering” (EH2C); and, (2) “Augmented-EH2C” (A-EH2C).
EH2C is a general framework to solve TSPN-like problems. The method uses a novel approach which hinges on the key idea of pre-computed feasible robot poses based on analytical formulation of Euclidian weighted functions. Results and benchmarking studies have showed that this approach allows to reach a faster convergence rate, when compared to the top-1method available in the public domain.
The EH2C methods has been then deployed to solve robotic task sequencing problem, with multiple attributes. This has led to the A-EH2C method, which introduces the concept of multi-attribute task sequencing, as a paradigm to solve coupled and hierarchical robotic task sequencing and path planning problems.
The thesis poses the following contributions: (1) enhanced heuristic approach based on Euclidian distance to define the initial guess points for constructing tour in TSPN; (2) multi-attribute approach to find the optimised task sequencing via candidate poses solving inverse kinematics in T-space; (3) break-through paradigm shift from static robot path planning to dynamic robot path to enable on-the-fly robot re-programming to facilitate product and process adjustments.
The proposed solutions have been tested in the context of automotive body assembly systems. However, results could impact a wider area, from navigation systems, game and graph theory, to autonomous systems.
Capítulos de livros sobre o assunto "Multi-Task Optimisation"
1
Ramachandran, Anil, Sunil Gupta, Santu Rana e Svetha Venkatesh. "Information-Theoretic Multi-task Learning Framework for Bayesian Optimisation". In AI 2019: Advances in Artificial Intelligence, 497–509. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-35288-2_40.
Texto completo da fonte
2
Lin, Jiabin, Qi Chen, Bing Xue e Mengjie Zhang. "AMTEA-Based Multi-task Optimisation for Multi-objective Feature Selection in Classification". In Applications of Evolutionary Computation, 623–39. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30229-9_40.
Texto completo da fonte
3
S., Nandhini, e Jeen Marseline K. S. "Intelligent Routing Scheme for FANET Using Bio-Inspired Optimisation". In Intelligent Decision Making Through Bio-Inspired Optimization, 218–26. IGI Global, 2024. http://dx.doi.org/10.4018/979-8-3693-2073-0.ch012.
Texto completo da fonteResumo:
An unmanned aerial vehicle (UAV) is an aircraft without a human pilot that is operated remotely. When multiple UAVs are connected together for performing specific task, the arrangement is called a flying adhoc network (FANET). In a multi-UAV system, communication and coordination among the flying nodes are essential to carry out the mission properly. As the flying nodes are highly dynamic in nature, an efficient routing strategy is important. The intelligent routing decisions in this scenario can be taken by applying bio-inspired optimisation algorithms. This chapter focuses on bio-inspired optimisation techniques for the FANET.
4
Xu, Xun. "Key Enabling Technologies". In Integrating Advanced Computer-Aided Design, Manufacturing, and Numerical Control, 354–93. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-59904-714-0.ch017.
Texto completo da fonteResumo:
While computers have proven to be instrumental in the advancement of product design and manufacturing processes, the role that various technologies have played over the years can never be over-estimated. Because of the intimate involvement of computers in the product development chain, technologies that have severed as enablers are in many cases all software- oriented. There are a number of issues that a technology needs to address in better support of CAD, CAPP, CAM, CNC, PDM, PLM, and so forth. Knowledge acquisition and utilization is one of the top priorities and very often the first step of actions. Intelligent reasoning and optimization is another important task. More often than not, the optimization problems have multi-objectives and multi-constraints that are highly non-linear, discrete, and sometimes fuzzy. Among the technologies that have been developed in the recent past are knowledgebased (expert) system, artificial neural network (ANN), genetic algorithm (GA), agent-based technology, fuzzy logic, Petri Nets, and ant colony optimisation. An expert system is a computer system which includes a well-organized body of knowledge in a bounded domain, and is able to simulate the problem solving skill of a human expert in a particular field. Neural networks are the techniques that can work by simulating the human neuron function, and using the weights distributed among their neurons to perform implicit inference. The genetic algorithms mimic the process of natural evolution by combining the survival of the fittest among solution structures with a structured, yet randomized, information exchange. Agent-based technology utilizes agents as intelligent entities capable of independently regulating, reasoning and decision-making to carry out actions and to achieve a specific goal or a set of goals. This chapter discusses these four technologies together with some applications of these technologies. Also briefly mentioned are the fuzzy logic, Petri Nets, and ant colony optimization methods. The objective is not to give a detailed account for each of these technologies. Instead, the intention is to introduce the technologies that are relevant to and suitable for applications such as CAD, CAPP, CAM, CNC, PDM, and PLM, as well as their integrations. This chapter can also be considered as a focal place for those who are interested in the technologies to further explore, as a collection of over 130 research publications have been cited and are all listed in the reference list at the back.
Trabalhos de conferências sobre o assunto "Multi-Task Optimisation"
1
Lin, Jiabin, Qi Chen, Bing Xue e Mengjie Zhang. "Multi-task optimisation for multi-objective feature selection in classification". In GECCO '22: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3520304.3528903.
Texto completo da fonte
2
Knerr, Bastian, Martin Holzer e Markus Rupp. "Task sheduling for power optimisation of multi frequency synchronous data flow graphs". In the 18th annual symposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1081081.1081100.
Texto completo da fonte
3
Knerr, Bastian, Martin Holzer e Markus Rupp. "Task Scheduling for Power Optimisation of Multi Frequency Synchronous Data Flow Graphs". In 2005 18th Symposium on Integrated Circuits and Systems Design. IEEE, 2005. http://dx.doi.org/10.1109/sbcci.2005.4286831.
Texto completo da fonte
4
Yue, Zhengjun, Heidi Christensen e Jon Barker. "Autoencoder Bottleneck Features with Multi-Task Optimisation for Improved Continuous Dysarthric Speech Recognition". In Interspeech 2020. ISCA: ISCA, 2020. http://dx.doi.org/10.21437/interspeech.2020-2746.
Texto completo da fonte
5
Xue, Y., B. Jiang e Y. Huang. "Optimisation strategy for multi-AGV multi-task assignment scheduling based on improved particle swarm genetic algorithm". In 5th International Conference on Artificial Intelligence and Advanced Manufacturing (AIAM 2023). Institution of Engineering and Technology, 2023. http://dx.doi.org/10.1049/icp.2023.2928.
Texto completo da fonte
6
Berends, J. P. T. J., M. J. L. Tooren e D. N. V. Belo. "A Distributed Multi-Disciplinary Optimisation of a Blended Wing Body UAV Using a Multi-Agent Task Environment". In 47th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference
14th AIAA/ASME/AHS Adaptive Structures Conference
7th. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2006. http://dx.doi.org/10.2514/6.2006-1610.
7
Berends, J. P. T. J., e M. J. L. Van Tooren. "Design of a Multi Agent Task Environment Framework to Support Multidisciplinary Design and Optimisation". In 45th AIAA Aerospace Sciences Meeting and Exhibit. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2007. http://dx.doi.org/10.2514/6.2007-969.
Texto completo da fonte
8
Saadatmand, Samad, e Salil S. Kanhere. "ACOMTA: An Ant Colony Optimisation based Multi-Task Assignment Algorithm for Reverse Auction based Mobile Crowdsensing". In 2020 IEEE 45th Conference on Local Computer Networks (LCN). IEEE, 2020. http://dx.doi.org/10.1109/lcn48667.2020.9314813.
Texto completo da fonte
9
Baert, Lieven, Paul Beaucaire, Michaël Leborgne, Caroline Sainvitu e Ingrid Lepot. "Tackling Highly Constrained Design Problems: Efficient Optimisation of a Highly Loaded Transonic Compressor". In ASME Turbo Expo 2017: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/gt2017-64610.
Texto completo da fonteResumo:
Turbomachinery components are designed to achieve high performances while being exposed to a complex flow environment with varying operating conditions. Whereas the purpose of a new design optimisation is straightforward — obtaining a better design than the already existing one — the actual process itself remains a challenging task, permanently confronted to the dual need to reduce the cycle time and to further integrate complexity and multiple physics. The extensive use of numerical simulations has contributed in a significant way to the design of state-of-the-art blade geometries. To deal with expensive high-fidelity computations, surrogate-based optimisation (SBO) has become an established and recognised approach. In order to be useful within an industrial context, it is crucial that this SBO process is capable of efficiently handling high-dimensional design spaces as well as managing highly constrained design problems. This work presents innovative auto-adaptive surrogates, exploiting a blend of interpolation/regression and classification, implemented in the integrated optimisation platform Minamo. As a demonstrator based on NASA Rotor 37, an aero-mechanical multi-point optimisation has been performed. For a design space with 60 parameters, significant performance gains have been obtained (+4% after 250 evaluations or less than a fortnight’s runtime) while considering over 30 constraints. The proposed SBO approach offers therefore many opportunities for turbomachinery applications tackling highly constrained design problems. Despite the unavoidable curse of dimensionality, the proposed approach is able to efficiently achieve reliable results at a cost that is in line with industrial needs and it provides a conclusive asset in the frame of design specifications evolving along the design cycle.
10
Recalde, Luis, Hong Yue, William Leithead, Olimpo Anaya-Lara, Hongda Liu e Jiang You. "Hybrid Renewable Energy Systems Sizing for Offshore Multi-Purpose Platforms". In ASME 2019 38th International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/omae2019-96017.
Texto completo da fonteResumo:
Abstract Integrating marine renewables and aquaculture is a complex task. The generated power of each renewable technology depends on its source cycle (wind, wave, solar PV), leading to periods of zero power production. On the other side, aquaculture farms require smooth and stable power supply since any power shortage can lead to the loss of the entire farm production. This paper illustrates the sizing of a hybrid energy system (wind,solar PV, energy storage) to power up the aquaculture farm. The sizing is based on available commercial technology and the system is mounted on a single multi-purpose platform. Reliability is improved by considering device redundancies. Such hybrid system has not been considered before for aquaculture farms. System rough sizing, based on simple online renewable energy calculators, is used to select existing renewable technologies and HOMER Pro simulation software is used to evaluate the technical and economic feasibility of the microgrid for all possible combinations of the technology selected and perform sensitivity analysis on wind turbine tower height, battery state of charge and solar PV panels reflectance. The optimisation is subject to combined dispatch strategy and net present cost.