Название: Metaheuristics for Robotics
Автор: Hamouche Oulhadj
Издательство: John Wiley & Sons Limited
Жанр: Программы
isbn: 9781119706991
isbn:
155 145
156 147
157 148
158 149
159 150
160 151
161 153
162 154
163 155
164 156
165 157
166 158
167 159
168 160
169 161
170 162
171 163
172 165
Optimization Heuristics Set
coordinated by
Nicolas Monmarché and Patrick Siarry
Volume 2
Metaheuristics for Robotics
Hamouche Oulhadj
Boubaker Daachi
Riad Menasri
First published 2020 in Great Britain and the United States by ISTE Ltd and John Wiley & Sons, Inc.
Apart from any fair dealing for the purposes of research or private study, or criticism or review, as permitted under the Copyright, Designs and Patents Act 1988, this publication may only be reproduced, stored or transmitted, in any form or by any means, with the prior permission in writing of the publishers, or in the case of reprographic reproduction in accordance with the terms and licenses issued by the CLA. Enquiries concerning reproduction outside these terms should be sent to the publishers at the undermentioned address:
ISTE Ltd
27-37 St George’s Road
London SW19 4EU
UK
John Wiley & Sons, Inc.
111 River Street
Hoboken, NJ 07030
USA
© ISTE Ltd 2020
The rights of Hamouche Oulhadj, Boubaker Daachi and Riad Menasri to be identified as the authors of this work have been asserted by them in accordance with the Copyright, Designs and Patents Act 1988.
Library of Congress Control Number: 2019952981
British Library Cataloguing-in-Publication Data
A CIP record for this book is available from the British Library
ISBN 978-1-78630-380-6
Preface
Optimization deals with methods that make it possible to optimize the use, operation and performance conditions of a system, whether it is physical or related to human activity. Situated at the crossroads of several disciplines, namely applied mathematics, computer science and artificial intelligence, optimization makes it possible to quickly find a solution to numerous problems which would otherwise be more difficult to solve relying solely on restricted mathematical analysis.
Based on heuristics or even metaheuristics at a higher level, optimization methods provide operational solutions, which are not necessarily optimal solutions but eligible suboptimal solutions, so-called acceptable solutions, because they demonstrate the level of performance required to reach a goal without conflicting with associated constraints. A number of problems whose resolution is based on optimization methods can be provided as examples:
— in finance, tax optimization is a means to minimize legal taxation;
— in databases, query optimization makes it possible to improve the accessibility of shared data, in particular by reducing transaction time;
— in telecommunications networks, routing optimization is a method for finding suitable paths for data exchange;
— in robotics, optimization allows, to take just one example, the identification of the best configurations (joint variables) that a robot must undergo in order to efficiently perform a task;
— in computer science, optimizing the code of a program makes it possible to reduce the memory space occupied and to increase the convergence time.
The applications outlined above are inherently very complex, which raises the problems of implementing accurate mathematical methods that provide admissible solutions without having to mobilize huge computational resources. In these circumstances, we are limited to considering approximated solutions, which are suboptimal solutions, but acceptable, ones since they guarantee goal realization while satisfying constraints.
In this book, we will address issues specifically related to the field of medical robotics. The focus of the applications being considered is on trajectory planning for redundant manipulative arms (articulated robots) within the context of surgical gesture assistance, and robust control for effort compensation or physical assistance in disability situations (exoskeleton). These applications are presented in detail, with the aim of understanding with the utmost clarity the problems to be solved, as well as the choices made to find effective solutions within a reasonable time frame.
The methods developed make use of optimization metaheuristics, which are high-level abstraction algorithms. Unlike heuristics, which are computational processes, often informally and “individually” adapted to specific problems, metaheuristics are general algorithms applicable to a very wide range of optimization problems, without the need to resort to a fundamental modification of the structure of these algorithms. The methods studied and results achieved are commented on and presented in detail for each of the applications addressed. Although the proposed methods are developed within the context of their application to medical robotics, their generic nature allows them to be easily expanded to other optimization problems which do not necessarily fall within the same scope of application.
Hamouche OULHADJ
Boubaker СКАЧАТЬ