Hybrid Algorithm combining Genetic algorithms and CSP approach to plane an Optimized path for a Mobile Robot moving under Time Window
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 3
Abstract
Abstract: The problems of optimization are considered as a type of a constraint satisfaction problem: COP (Constraint Optimization problem). In this frame goes our first works which are interested in the optimization of a reference trajectory of a mobile robot used for the surveillance (Surveyor Robot). Indeed, in the previous work we have focused on the minimization of the length of this trajectory by using the approach of the genetic algorithms. At the level of our present researches we shall add temporal windows to limit the time delayed in the passage between one surveyed site and the following one. The consideration of temporal aspects requires a modelling of problem with a satisfaction of constraints. So that, a hybridization of the algorithm of optimization already developed at the previous work by the approach of CSP (Constraint Satisfaction Problem), is indispensable for our case. The new algorithm which will be developed and feigned at this work is a genetic algorithm allowing minimizing the length of a trajectory crossed by a mobile robot of surveillance by respecting the time fixed to take during the passage through two successive sites.
Authors and Affiliations
Hayet Tlijani , Tlijani Hatem , Knani Jilani , M’sirdi NacerKouider
Keywords
Related Articles
- EP ID EP121424
- DOI 10.9790/0661-16337483
- Views 104
- Downloads 0
Simple Load Rebalancing For Distributed Hash Tables In Cloud
Distributed file systems are key building blocks for cloud computing applications based on the Map Reduce programming paradigm. In such file systems, nodes simultaneously serve computing and storage functi...
Computer Forensic Investigation on Hard Drive Data Recovery: A Review Study
Abstract: Computer Forensics is a science of seeking evidence found in computers and digital storage media. The main challenge before computer forensic investigatorsis to examine digital media with the aim of finding, co...
An improved Item-based Maxcover Algorithm to protect Sensitive Patterns in Large Databases
Privacy Preserving Data Mining(PPDM) is a rising field of research in Data Mining and various approaches are being introduced by the researchers. One of the approaches is a sanitization process, that transform...
Privacy Protection in Personalized Web Search Via TaxonomyStructure
Abstract: Web search engine has long become the most important portal for ordinary people looking foruseful information on the web. User might experience failure when search engine return irrelevanceinformation due to en...
A Novel Approach for Workload Optimization and ImprovingSecurity in Cloud Computing Environments
Abstract: This paper discusses a propose cloud infrastructure that combines On-Demand allocation ofresources with improved utilization, opportunistic provisioning of cycles from idle cloud nodes to otherprocesses.B...