{"id":{"repo_id":"njit","oai_identifier":"oai:digitalcommons.njit.edu:theses-3702"},"canonical_url":"https://search.ndltd.org/etd/njit/oai:digitalcommons.njit.edu:theses-3702","repository":{"repo_id":"njit","name":"NJIT","base_url":"https://digitalcommons.njit.edu/do/oai/"},"display":{"title":"Mobile manipulator path planning by a genetic algorithm","abstract":"<p>The thesis addresses the path planning problem for a mobile manipulator system which is used to perform a sequence of tasks specified by locations and minimum oriented force capabilities. The problem is to find an optimal sequence of base positions and manipulator configurations for performing a sequence of tasks given a series of task specifications. The formulation of the problem is nonlinear. The feasible regions for the problem are nonconvex and unconnected. Genetic algorithms applied to such problems appear to be very promising while traditional optimization methods cause difficulties. Computer simulation is carried out on a three degrees-of-freedom manipulator mounted on a 2 degrees-of-freedom mobile base to search for the near optimal path planning solution for performing the sequence of tasks.</p>","abstract_html":"&lt;p&gt;The thesis addresses the path planning problem for a mobile manipulator system which is used to perform a sequence of tasks specified by locations and minimum oriented force capabilities. The problem is to find an optimal sequence of base positions and manipulator configurations for performing a sequence of tasks given a series of task specifications. The formulation of the problem is nonlinear. The feasible regions for the problem are nonconvex and unconnected. Genetic algorithms applied to such problems appear to be very promising while traditional optimization methods cause difficulties. Computer simulation is carried out on a three degrees-of-freedom manipulator mounted on a 2 degrees-of-freedom mobile base to search for the near optimal path planning solution for performing the sequence of tasks.&lt;/p&gt;","abstract_has_math":false,"creators":["Zhao, Min"],"institution":null,"degree_name":"Master of Science in Electrical Engineering - (M.S.)","degree_level":null,"degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Nirwan Ansari","Edwin Hou","Zoran Siveski"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:42:44Z","subjects":["Manipulators (Mechanism) -- Computer simulation","Manipulators (Mechanism) -- Mathematical models","Electrical and Electronics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.njit.edu/theses/2688","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.njit.edu/theses/2688","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.njit.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.njit.edu%3Atheses-3702","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Nirwan Ansari","Edwin Hou","Zoran Siveski"]},{"key":"dc:creator","label":"Author","values":["Zhao, Min"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["1991-08-31T07:00:00Z"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Electrical Engineering - (M.S.)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Manipulators (Mechanism) -- Computer simulation","Manipulators (Mechanism) -- Mathematical models","Electrical and Electronics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.njit.edu/theses/2688"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>The thesis addresses the path planning problem for a mobile manipulator system which is used to perform a sequence of tasks specified by locations and minimum oriented force capabilities. The problem is to find an optimal sequence of base positions and manipulator configurations for performing a sequence of tasks given a series of task specifications. The formulation of the problem is nonlinear. The feasible regions for the problem are nonconvex and unconnected. Genetic algorithms applied to such problems appear to be very promising while traditional optimization methods cause difficulties. Computer simulation is carried out on a three degrees-of-freedom manipulator mounted on a 2 degrees-of-freedom mobile base to search for the near optimal path planning solution for performing the sequence of tasks.</p>"]},{"key":"dc:title","label":"Title","values":["Mobile manipulator path planning by a genetic algorithm"]}]}],"canonical_facts":{"dc:contributor":["Nirwan Ansari","Edwin Hou","Zoran Siveski"],"dc:creator":["Zhao, Min"],"dc:date.created":["1991-08-31T07:00:00Z"],"dc:description.abstract":["<p>The thesis addresses the path planning problem for a mobile manipulator system which is used to perform a sequence of tasks specified by locations and minimum oriented force capabilities. The problem is to find an optimal sequence of base positions and manipulator configurations for performing a sequence of tasks given a series of task specifications. The formulation of the problem is nonlinear. The feasible regions for the problem are nonconvex and unconnected. Genetic algorithms applied to such problems appear to be very promising while traditional optimization methods cause difficulties. Computer simulation is carried out on a three degrees-of-freedom manipulator mounted on a 2 degrees-of-freedom mobile base to search for the near optimal path planning solution for performing the sequence of tasks.</p>"],"dc:identifier":["https://digitalcommons.njit.edu/theses/2688"],"dc:subject":["Manipulators (Mechanism) -- Computer simulation","Manipulators (Mechanism) -- Mathematical models","Electrical and Electronics"],"dc:title":["Mobile manipulator path planning by a genetic algorithm"],"dc:type":["Thesis"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_name":["Master of Science in Electrical Engineering - (M.S.)"]},"updated_at":"2026-11-19T08:42:44Z"}