Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Conditional Coverage Path Planning Method for an Autonomous Lawn Mower
Date
2016-07-12
Author
Karol, Ardıç
Konukseven, Erhan İlhan
Koku, Ahmet Buğra
Çiçek, Serkan
Metadata
Show full item record
Item Usage Stats
121
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/74470
Collections
Unverified, Conference / Seminar
Suggestions
OpenMETU
Core
A Conditional coverage path planning method for an autonomous lawn mower
Karol, Ardıç; Konukseven, Erhan İlhan; Koku, Ahmet Buğra; Department of Mechanical Engineering (2016)
Randomized and deterministic coverage path planning methods are widely used in autonomous lawn mowers. Random planning cannot guarantee a complete coverage, whereas, many deterministic techniques are not solely eligible for unstructured outdoor environments, since they highly suffer from wheel slippage or numerical drift. Besides, complete coverage techniques either demands high computational power or expensive sensor hardware. A genuine, Conditional Coverage Path Planning (CCPP) method, which satisfies com...
A self-organizing neural network approach for the single AGV routing problem
Soylu, M; Özdemirel, Nur Evin; Kayaligil, S (2000-02-15)
In this research, a special form of Automated Guided Vehicle (AGV) routing problem is investigated. The objective is to find the shortest tour for a single, free-ranging AGV that has to carry out multiple pick and deliver (P&D) requests. This problem is an incidence of the asymmetric traveling salesman problem which is known to be NP-complete. An artificial neural network algorithm based on Kohonen's self-organizing feature maps is developed to solve the problem, and several improvements on the basic featur...
A context aware model for autonomous agent stochastic planning
Ekmekci, Ömer; Polat, Faruk (Elsevier BV, 2019-02-01)
Markov Decision Processes (MDPs) are not able to make use of domain information effectively due to their representational limitations. The lacking of elements which enable the models be aware of context, leads to unstructured representation of that problem such as raw probability matrices or lists. This causes these tools significantly less efficient at determining a useful policy as the state space of a task grows, which is the case for more realistic problems having localized dependencies between states a...
A Multi-criteria decision analysis approach to GIS-based route selection for overhead power transmission lines
Dedemen, Yiğit; Karslıoğlu, Mahmut Onur; Department of Geodetic and Geographical Information Technologies (2013)
Multi-criteria decision analysis (MCDA) techniques are popular to select the route of linear structures. In this study, Geographical Information Systems (GIS) is employed to assess all the criteria, which are requested to determine the preferable route of power transmission line (PTL). A MCDA model is established on the basis of the Analytic Hierarchy Process (AHP) and Preference Ranking Organization Method for Enrichment Evaluations (PROMETHEE). Because of the complexity of the routing problem, GIS and MCD...
A Trie-structured Bayesian Model for Unsupervised Morphological Segmentation
Kurfalı, Murathan; Ustun, Ahmet; CAN BUĞLALILAR, BURCU (2017-04-23)
In this paper, we introduce a trie-structured Bayesian model for unsupervised morphological segmentation. We adopt prior information from different sources in the model. We use neural word embeddings to discover words that are morphologically derived from each other and thereby that are semantically similar. We use letter successor variety counts obtained from tries that are built by neural word embeddings. Our results show that using different information sources such as neural word embeddings and letter s...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Karol, E. İ. Konukseven, A. B. Koku, and S. Çiçek, “A Conditional Coverage Path Planning Method for an Autonomous Lawn Mower,” 2016, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/74470.