Výsledky vědy a výzkumu
A Framework for Multicriteria Selection Based on Measuring Query Responses
Publikace Rok: 2003
ŠEDA, M., DVOŘÁK, J.
Zobrazeny výsledky 391–405 z 2086
Array
(
[page] => 27
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 12865
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 47001
[vysledek_rok] => 2004
[nazev] => Motion Planning in the Plane with Obstacles
[nazev_orig] => Motion Planning in the Plane with Obstacles
[duvernost_udaju_id] => S
[popis] => The task of planning trajectories plays an important role in transportation, robotics, even in information systems (sending messages). In robot motion planning the robot should pass around the obstacles, from a given starting position to a given target position, touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research on path planning has yielded many fundamentally different approaches to its solution, e.g. visibility graph method or the shortest path map method. Assuming movements only in a restricted number of directions (eight directional, horizontal/vertical) the task, with respect to its combinatorial nature, can be solved by heuristic techniques (genetic algorithms, simulated annealing, tabu-search). We present a framework of such approach and show its drawbacks (combinatorial explosion, limited granularity, generating infeasible solutions). Application of the Voronoi diagrams to the studied tasks can be seen as the main result of this paper. This approach needs only polynomial time and choosing Euclidean or rectilinear metric it can be adapted to tasks with general or directional-constrained movements.
[popis_orig] => The task of planning trajectories plays an important role in transportation, robotics, even in information systems (sending messages). In robot motion planning the robot should pass around the obstacles, from a given starting position to a given target position, touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research on path planning has yielded many fundamentally different approaches to its solution, e.g. visibility graph method or the shortest path map method. Assuming movements only in a restricted number of directions (eight directional, horizontal/vertical) the task, with respect to its combinatorial nature, can be solved by heuristic techniques (genetic algorithms, simulated annealing, tabu-search). We present a framework of such approach and show its drawbacks (combinatorial explosion, limited granularity, generating infeasible solutions). Application of the Voronoi diagrams to the studied tasks can be seen as the main result of this paper. This approach needs only polynomial time and choosing Euclidean or rectilinear metric it can be adapted to tasks with general or directional-constrained movements.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] =>
[identifikator_popis] =>
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Motion Planning in the Plane with Obstacles. In Abstracts of Summer School on Control Theory and Applications. Graz (Austria): Graz University of Technology, 2004. 12 p.
[citace_html] => ŠEDA, M. Motion Planning in the Plane with Obstacles. In Abstracts of Summer School on Control Theory and Applications. Graz (Austria): Graz University of Technology, 2004. 12 p.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT12865,
author="Miloš {Šeda}",
title="Motion Planning in the Plane with Obstacles",
booktitle="Abstracts of Summer School on Control Theory and Applications",
year="2004",
pages="12",
publisher="Graz University of Technology",
address="Graz (Austria)"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => Motion Planning in the Plane with Obstacles
[popis_en] => The task of planning trajectories plays an important role in transportation, robotics, even in information systems (sending messages). In robot motion planning the robot should pass around the obstacles, from a given starting position to a given target position, touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research on path planning has yielded many fundamentally different approaches to its solution, e.g. visibility graph method or the shortest path map method. Assuming movements only in a restricted number of directions (eight directional, horizontal/vertical) the task, with respect to its combinatorial nature, can be solved by heuristic techniques (genetic algorithms, simulated annealing, tabu-search). We present a framework of such approach and show its drawbacks (combinatorial explosion, limited granularity, generating infeasible solutions). Application of the Voronoi diagrams to the studied tasks can be seen as the main result of this paper. This approach needs only polynomial time and choosing Euclidean or rectilinear metric it can be adapted to tasks with general or directional-constrained movements.
[klicova_slova_en] => Motion planning, genetic algorithm, case-based reasoning, Voronoi diagram, rectilinear metric
[vysledek_datum] => 2004-09-01T00:00:00+02:00
)
[1] => Array
(
[vysledek_id] => 12866
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 47002
[vysledek_rok] => 2004
[nazev] => An Application of Fuzzy Logic to Signal Detection
[nazev_orig] => An Application of Fuzzy Logic to Signal Detection
[duvernost_udaju_id] => S
[popis] => Provozování technických procesů vyžaduje neustále rostoucí nároky na úroveň diagnostiky chyb, která slouží k zvýšení spolehlivosti, bezpečnosti a hospodárnosti. Detekční algoritmy jsou většinou optimalizovány vzhledem k určité množině cenových funkcí zvolených v závislosti na aplikaci. V posledních několika letech oblast detekčních systémů a jejich aplikací zaznamenala velký růst. Používají se metody soft computingu, které patří do oblasti umělé inteligence. V příspěvku navrhujeme pro detekci nebezpečných stavů zařízení metodu založenou na fuzzy mírách podobnosti periodicky měřených nebo odhadovaných parametrů s kritickými hodnotami sledovaných parametrů uložených v databázi.
[popis_orig] => Provozování technických procesů vyžaduje neustále rostoucí nároky na úroveň diagnostiky chyb, která slouží k zvýšení spolehlivosti, bezpečnosti a hospodárnosti. Detekční algoritmy jsou většinou optimalizovány vzhledem k určité množině cenových funkcí zvolených v závislosti na aplikaci. V posledních několika letech oblast detekčních systémů a jejich aplikací zaznamenala velký růst. Používají se metody soft computingu, které patří do oblasti umělé inteligence. V příspěvku navrhujeme pro detekci nebezpečných stavů zařízení metodu založenou na fuzzy mírách podobnosti periodicky měřených nebo odhadovaných parametrů s kritickými hodnotami sledovaných parametrů uložených v databázi.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M., JIRKŮ, J.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 83-89772-00-0
[identifikator_popis] => ISBN - Proceedings of the 5th International Carpathian Control Conference ICCC ’2004
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M., JIRKŮ, J. An Application of Fuzzy Logic to Signal Detection. In Proceedings of the 5th International Carpathian Control Conference ICCC ’2004. Zakopane (Poland): Faculty of Mechanical Engineering and Robotics AGH UST Krakow, 2004. 6 p. ISBN: 83-89772-00-0.
[citace_html] => ŠEDA, M., JIRKŮ, J. An Application of Fuzzy Logic to Signal Detection. In Proceedings of the 5th International Carpathian Control Conference ICCC ’2004. Zakopane (Poland): Faculty of Mechanical Engineering and Robotics AGH UST Krakow, 2004. 6 p. ISBN: 83-89772-00-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT12866,
author="Miloš {Šeda} and Jaroslav {Jirků}",
title="An Application of Fuzzy Logic to Signal Detection",
booktitle="Proceedings of the 5th International Carpathian Control Conference ICCC ’2004",
year="2004",
pages="6",
publisher="Faculty of Mechanical Engineering and Robotics AGH UST Krakow",
address="Zakopane (Poland)",
isbn="83-89772-00-0"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => An Application of Fuzzy Logic to Signal Detection
[popis_en] => The operation of technical processes requires increasingly advanced supervision and fault diagnosis to improve reliability, safety, and economy. Detection algorithms are generally optimised with respect to a particular set of cost functions chosen for the specific application. In the last few years in the field of detection systems there have been an increasing number of applications based on algorithms using methodologies, which belong to a subclass of Artificial Intelligence called Soft Computing. In this paper we propose a fuzzy method for the detection of dangerous states based on matching a predefined database of these states with periodically measured or estimated parameter values.
[klicova_slova_en] => fault detection, similarity measure, threshold-based detector, fuzzy detector
[vysledek_datum] => 2004-05-01T00:00:00+02:00
)
[2] => Array
(
[vysledek_id] => 12867
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 47003
[vysledek_rok] => 2004
[nazev] => Signal Detection Based on Similarity Measures
[nazev_orig] => Signal Detection Based on Similarity Measures
[duvernost_udaju_id] => S
[popis] => The operation of technical processes requires increasingly advanced supervision and fault diagnosis to improve reliability, safety, and economy. Detection algorithms are generally optimised with respect to a particular set of cost functions chosen for the specific application. In the last few years in the field of detection systems there have been an increasing number of applications based on algorithms using methodologies, which belong to a subclass of Artificial Intelligence called Soft Computing. In this paper we propose a fuzzy similarity measure-based method for the detection of dangerous states based on matching a predefined database of these states with periodically measured or estimated parameter values.
[popis_orig] => The operation of technical processes requires increasingly advanced supervision and fault diagnosis to improve reliability, safety, and economy. Detection algorithms are generally optimised with respect to a particular set of cost functions chosen for the specific application. In the last few years in the field of detection systems there have been an increasing number of applications based on algorithms using methodologies, which belong to a subclass of Artificial Intelligence called Soft Computing. In this paper we propose a fuzzy similarity measure-based method for the detection of dangerous states based on matching a predefined database of these states with periodically measured or estimated parameter values.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M., JIRKŮ, J.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-227-2059-3
[identifikator_popis] => ISBN - Abstracts of the 6th International Conference Control of Power Systems ’04
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M., JIRKŮ, J. Signal Detection Based on Similarity Measures. In Abstracts of the 6th International Conference Control of Power Systems ’04. Štrbské Pleso (Slovakia): Slovak University of Technology, 2004. 1 p. ISBN: 80-227-2059-3.
[citace_html] => ŠEDA, M., JIRKŮ, J. Signal Detection Based on Similarity Measures. In Abstracts of the 6th International Conference Control of Power Systems ’04. Štrbské Pleso (Slovakia): Slovak University of Technology, 2004. 1 p. ISBN: 80-227-2059-3.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT12867,
author="Miloš {Šeda} and Jaroslav {Jirků}",
title="Signal Detection Based on Similarity Measures",
booktitle="Abstracts of the 6th International Conference Control of Power Systems ’04",
year="2004",
pages="1",
publisher="Slovak University of Technology",
address="Štrbské Pleso (Slovakia)",
isbn="80-227-2059-3"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Signal Detection Based on Similarity Measures
[popis_en] => The operation of technical processes requires increasingly advanced supervision and fault diagnosis to improve reliability, safety, and economy. Detection algorithms are generally optimised with respect to a particular set of cost functions chosen for the specific application. In the last few years in the field of detection systems there have been an increasing number of applications based on algorithms using methodologies, which belong to a subclass of Artificial Intelligence called Soft Computing. In this paper we propose a fuzzy similarity measure-based method for the detection of dangerous states based on matching a predefined database of these states with periodically measured or estimated parameter values.
[klicova_slova_en] => fault detection, similarity measure, threshold-based detector, fuzzy detector
[vysledek_datum] => 2004-06-01T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 12870
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 47006
[vysledek_rok] => 2004
[nazev] => Robot Navigation Using Voronoi Diagrams
[nazev_orig] => Robot Navigation Using Voronoi Diagrams
[duvernost_udaju_id] => S
[popis] => The task of planning trajectories plays an important role in transportation, robotics, etc. In robot motion planning the robot should pass around the obstacles, from a given starting position to a given target position, touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research on path planning has yielded many fundamentally different approaches to its solution, e.g. visibility graph method or the shortest path map method. Assuming movements only in a restricted number of directions (eight directional, horizontal/vertical) the task, with respect to its combinatorial nature, must be solved by heuristic techniques. We propose an application of the Voronoi diagrams to the studied tasks and show that this approach needs only polynomial time and choosing Euclidean or rectilinear metric it can be adapted to tasks with general or directional-constrained movements.
[popis_orig] => The task of planning trajectories plays an important role in transportation, robotics, etc. In robot motion planning the robot should pass around the obstacles, from a given starting position to a given target position, touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research on path planning has yielded many fundamentally different approaches to its solution, e.g. visibility graph method or the shortest path map method. Assuming movements only in a restricted number of directions (eight directional, horizontal/vertical) the task, with respect to its combinatorial nature, must be solved by heuristic techniques. We propose an application of the Voronoi diagrams to the studied tasks and show that this approach needs only polynomial time and choosing Euclidean or rectilinear metric it can be adapted to tasks with general or directional-constrained movements.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-85918-88-9
[identifikator_popis] => ISBN - Book of Extended Abstracts of the National Conference with International Participation Engineering Mechanics 2004
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Robot Navigation Using Voronoi Diagrams. In Book of Extended Abstracts of the National Conference with International Participation Engineering Mechanics 2004. Svratka: Academy of Sciences of the Czech Republic, 2004. 2 p. ISBN: 80-85918-88-9.
[citace_html] => ŠEDA, M. Robot Navigation Using Voronoi Diagrams. In Book of Extended Abstracts of the National Conference with International Participation Engineering Mechanics 2004. Svratka: Academy of Sciences of the Czech Republic, 2004. 2 p. ISBN: 80-85918-88-9.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT12870,
author="Miloš {Šeda}",
title="Robot Navigation Using Voronoi Diagrams",
booktitle="Book of Extended Abstracts of the National Conference with International Participation Engineering Mechanics 2004",
year="2004",
pages="2",
publisher="Academy of Sciences of the Czech Republic",
address="Svratka",
isbn="80-85918-88-9"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => Robot Navigation Using Voronoi Diagrams
[popis_en] => The task of planning trajectories plays an important role in transportation, robotics, etc. In robot motion planning the robot should pass around the obstacles, from a given starting position to a given target position, touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research on path planning has yielded many fundamentally different approaches to its solution, e.g. visibility graph method or the shortest path map method. Assuming movements only in a restricted number of directions (eight directional, horizontal/vertical) the task, with respect to its combinatorial nature, must be solved by heuristic techniques. We propose an application of the Voronoi diagrams to the studied tasks and show that this approach needs only polynomial time and choosing Euclidean or rectilinear metric it can be adapted to tasks with general or directional-constrained movements.
[klicova_slova_en] => Motion planning, Voronoi diagram, rectilinear metric
[vysledek_datum] => 2004-05-01T00:00:00+02:00
)
[4] => Array
(
[vysledek_id] => 13211
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 40440
[vysledek_rok] => 2003
[nazev] => Monitorování a dokumentace pohybu
[nazev_orig] => Monitorování a dokumentace pohybu
[duvernost_udaju_id] => S
[popis] => Detekce a záznam pohybu slouží k zachycení změn pohybu na obrazové scéně. Detekce pohybu má široké a všestranné použití. V současné době se jedná zejména o střežení vstupů do objektů. V tomto příspěvku bude nejprve shrnuta problematika zpracování obrazové scény, uvedeny způsoby vyhodnocování obrazu a popsána vytvořená aplikace, která řeší monitorování a vyhodnocování pohybu.
[popis_orig] => Detekce a záznam pohybu slouží k zachycení změn pohybu na obrazové scéně. Detekce pohybu má široké a všestranné použití. V současné době se jedná zejména o střežení vstupů do objektů. V tomto příspěvku bude nejprve shrnuta problematika zpracování obrazové scény, uvedeny způsoby vyhodnocování obrazu a popsána vytvořená aplikace, která řeší monitorování a vyhodnocování pohybu.
[klicova_slova] => Záznam pohybu, velikost obrazu, disková kapacita.
[klicova_slova_orig] => Záznam pohybu, velikost obrazu, disková kapacita.
[url] =>
[oecd_obor_id] =>
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => SOUKUP, K., DAVIDOVÁ, O.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-7318-129-0
[identifikator_popis] => ISBN - TD 2003 - DIAGON 2003
[riv_dodavka_id] => 65
[riv_dodavka_oznaceni] => RIV11-MSM-26210___
[riv_dodavka_rok] => 2011
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => SOUKUP, K., DAVIDOVÁ, O. Monitorování a dokumentace pohybu. In TD 2003 - DIAGON 2003. Zlín: Academia centrum Univerzity Tomáše Bati ve Zlíně, 2003. 6 s. ISBN: 80-7318-129-0.
[citace_html] => SOUKUP, K., DAVIDOVÁ, O. Monitorování a dokumentace pohybu. In TD 2003 - DIAGON 2003. Zlín: Academia centrum Univerzity Tomáše Bati ve Zlíně, 2003. 6 s. ISBN: 80-7318-129-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT13211,
author="Karel {Soukup} and Olga {Davidová}",
title="Monitorování a dokumentace pohybu",
booktitle="TD 2003 - DIAGON 2003",
year="2003",
number="1",
pages="6",
publisher="Academia centrum Univerzity Tomáše Bati ve Zlíně",
address="Zlín",
isbn="80-7318-129-0"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] =>
[oecd_tree_oblast_nazev] =>
[oecd_tree_obor_id] =>
[oecd_tree_obor_nazev] =>
[oecd_tree_podobor_id] =>
[oecd_tree_podobor_nazev] =>
[poznamka_metriky] =>
[nazev_en] => Recording and monitoring moving
[popis_en] => Detection and recording of motion we using for display change on the watch area. The detection of motion we mainly using for guard entry of houses. This paper describes theory of picture scene, and demonstrate program for recording of motion.
[klicova_slova_en] => Recording of the motion, picture size, hard disk capacity.
[vysledek_datum] => 2003-05-15T00:00:00+02:00
)
[5] => Array
(
[vysledek_id] => 13219
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 40457
[vysledek_rok] => 2003
[nazev] => A Framework for Multicriteria Selection Based on Measuring Query Responses
[nazev_orig] => A Framework for Multicriteria Selection Based on Measuring Query Responses
[duvernost_udaju_id] => S
[popis] => This paper deals with a problem of multicriteria selection assuming uncertainties including linguistic modifiers both in given data and in queries referring to these data. An approach based on measuring similarities of required properties to values of corresponding fields in relational database records is presented.
[popis_orig] => This paper deals with a problem of multicriteria selection assuming uncertainties including linguistic modifiers both in given data and in queries referring to these data. An approach based on measuring similarities of required properties to values of corresponding fields in relational database records is presented.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M., DVOŘÁK, J.
[pocet_tvurcu] => 2
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 3-9808089-4-7
[identifikator_popis] => ISBN - Proceedings of the 3rd International Conference in Fuzzy Logic and Technology EUSFLAT 2003
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M., DVOŘÁK, J. A Framework for Multicriteria Selection Based on Measuring Query Responses. In Proceedings of the 3rd International Conference in Fuzzy Logic and Technology EUSFLAT 2003. Zittau (Germany): European Society for Fuzzy Logic and Technology, 2003. 6 p. ISBN: 3-9808089-4-7.
[citace_html] => ŠEDA, M., DVOŘÁK, J. A Framework for Multicriteria Selection Based on Measuring Query Responses. In Proceedings of the 3rd International Conference in Fuzzy Logic and Technology EUSFLAT 2003. Zittau (Germany): European Society for Fuzzy Logic and Technology, 2003. 6 p. ISBN: 3-9808089-4-7.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT13219,
author="Miloš {Šeda} and Jiří {Dvořák}",
title="A Framework for Multicriteria Selection Based on Measuring Query Responses",
booktitle="Proceedings of the 3rd International Conference in Fuzzy Logic and Technology EUSFLAT 2003",
year="2003",
pages="6",
publisher="European Society for Fuzzy Logic and Technology",
address="Zittau (Germany)",
isbn="3-9808089-4-7"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => A Framework for Multicriteria Selection Based on Measuring Query Responses
[popis_en] => This paper deals with a problem of multicriteria selection assuming uncertainties including linguistic modifiers both in given data and in queries referring to these data. An approach based on measuring similarities of required properties to values of corresponding fields in relational database records is presented.
[klicova_slova_en] => Fuzzy database, fuzzy query, linguistic modifiers
[vysledek_datum] => 2003-09-01T00:00:00+02:00
)
[6] => Array
(
[vysledek_id] => 13220
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 40461
[vysledek_rok] => 2003
[nazev] => An Approximation for the Steiner Tree Problem in the Euclidean Plane
[nazev_orig] => An Approximation for the Steiner Tree Problem in the Euclidean Plane
[duvernost_udaju_id] => S
[popis] => The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approximations or heuristics are desired. In this paper, a modification of the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed.
[popis_orig] => The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approximations or heuristics are desired. In this paper, a modification of the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 9958-617-18-8
[identifikator_popis] => ISBN - Proceedings of the 7th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2003
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. An Approximation for the Steiner Tree Problem in the Euclidean Plane. In Proceedings of the 7th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2003. Barcelona (Spain): Universitat Politecnica de Catalunya, 2003. 4 p. ISBN: 9958-617-18-8.
[citace_html] => ŠEDA, M. An Approximation for the Steiner Tree Problem in the Euclidean Plane. In Proceedings of the 7th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2003. Barcelona (Spain): Universitat Politecnica de Catalunya, 2003. 4 p. ISBN: 9958-617-18-8.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT13220,
author="Miloš {Šeda}",
title="An Approximation for the Steiner Tree Problem in the Euclidean Plane",
booktitle="Proceedings of the 7th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2003",
year="2003",
pages="4",
publisher="Universitat Politecnica de Catalunya",
address="Barcelona (Spain)",
isbn="9958-617-18-8"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => An Approximation for the Steiner Tree Problem in the Euclidean Plane
[popis_en] => The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approximations or heuristics are desired. In this paper, a modification of the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed.
[klicova_slova_en] => Steiner tree, minimum spanning tree, Delaunay triangulation, heuristic
[vysledek_datum] => 2003-09-01T00:00:00+02:00
)
[7] => Array
(
[vysledek_id] => 13221
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 40464
[vysledek_rok] => 2003
[nazev] => Motion Planning Using Voronoi Diagrams
[nazev_orig] => Motion Planning Using Voronoi Diagrams
[duvernost_udaju_id] => S
[popis] => A Voronoi diagram of a set of sites in the Euclidean plane is a collection of regions that divide up the plane. Each region corresponds to one of the sites and all the points in one region are closer to the site representing the region than to any other site. Voronoi diagrams have a surprising variety of uses, e.g. nearest neighbour search, facility location, path planning, etc. In this paper, we investigate the problem of point-to-point eightdirectional motion planning in the 2D space containing point and rectangular obstacles. and propose a method for solving this problem using rectilinear Voronoi diagrams.
[popis_orig] => A Voronoi diagram of a set of sites in the Euclidean plane is a collection of regions that divide up the plane. Each region corresponds to one of the sites and all the points in one region are closer to the site representing the region than to any other site. Voronoi diagrams have a surprising variety of uses, e.g. nearest neighbour search, facility location, path planning, etc. In this paper, we investigate the problem of point-to-point eightdirectional motion planning in the 2D space containing point and rectangular obstacles. and propose a method for solving this problem using rectilinear Voronoi diagrams.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Ústav automatizace a informatiky
[odpovedny_utvar_zkratka] => ÚAI
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FSI
[nadrazena_soucast_nazev] => Fakulta strojního inženýrství
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publikační výsledky
[druh_nazev] => Stať ve sborníku v databázi WoS či Scopus
[druh_popis] => Stať ve sborníku v databázi WoS či Scopus
[stav] => Schválený
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 80-7099-509-2
[identifikator_popis] => ISBN - Proceedings of the 4th International Carpathian Control Conference ICCC ‘20003
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Motion Planning Using Voronoi Diagrams. In Proceedings of the 4th International Carpathian Control Conference ICCC ‘20003. Tatranská Lomnica (Slovakia): TU Košice, 2003. 632 p. ISBN: 80-7099-509-2.
[citace_html] => ŠEDA, M. Motion Planning Using Voronoi Diagrams. In Proceedings of the 4th International Carpathian Control Conference ICCC ‘20003. Tatranská Lomnica (Slovakia): TU Košice, 2003. 632 p. ISBN: 80-7099-509-2.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT13221,
author="Miloš {Šeda}",
title="Motion Planning Using Voronoi Diagrams",
booktitle="Proceedings of the 4th International Carpathian Control Conference ICCC ‘20003",
year="2003",
pages="632",
publisher="TU Košice",
address="Tatranská Lomnica (Slovakia)",
isbn="80-7099-509-2"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => Motion Planning Using Voronoi Diagrams
[popis_en] => A Voronoi diagram of a set of sites in the Euclidean plane is a collection of regions that divide up the plane. Each region corresponds to one of the sites and all the points in one region are closer to the site representing the region than to any other site. Voronoi diagrams have a surprising variety of uses, e.g. nearest neighbour search, facility location, path planning, etc. In this paper, we investigate the problem of point-to-point eightdirectional motion planning in the 2D space containing point and rectangular obstacles. and propose a method for solving this problem using rectilinear Voronoi diagrams.
[klicova_slova_en] => motion planning, rectilinear metric, Voronoi diagram
[vysledek_datum] => 2003-05-01T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 27
[count] => 8
[n_pages] => 140
[pagelen] => 15
[odkaz] => typVysledku=&rok=&ftext=&btnSubmit=1
[base_detail] => /veda/publikace/detail/
[base_page] => /veda/publikace
[vysledek] => Array
(
[0] => Array
(
[quotations] => ŠEDA, M.
[title] => Motion Planning in the Plane with Obstacles
[typ] => PV
[year] => 2004
[id_vav] => 12865
)
[1] => Array
(
[quotations] => ŠEDA, M., JIRKŮ, J.
[title] => An Application of Fuzzy Logic to Signal Detection
[typ] => PV
[year] => 2004
[id_vav] => 12866
)
[2] => Array
(
[quotations] => ŠEDA, M., JIRKŮ, J.
[title] => Signal Detection Based on Similarity Measures
[typ] => PV
[year] => 2004
[id_vav] => 12867
)
[3] => Array
(
[quotations] => ŠEDA, M.
[title] => Robot Navigation Using Voronoi Diagrams
[typ] => PV
[year] => 2004
[id_vav] => 12870
)
[4] => Array
(
[quotations] => SOUKUP, K., DAVIDOVÁ, O.
[title] => Monitorování a dokumentace pohybu
[typ] => PV
[year] => 2003
[id_vav] => 13211
)
[5] => Array
(
[quotations] => ŠEDA, M., DVOŘÁK, J.
[title] => A Framework for Multicriteria Selection Based on Measuring Query Responses
[typ] => PV
[year] => 2003
[id_vav] => 13219
)
[6] => Array
(
[quotations] => ŠEDA, M.
[title] => An Approximation for the Steiner Tree Problem in the Euclidean Plane
[typ] => PV
[year] => 2003
[id_vav] => 13220
)
[7] => Array
(
[quotations] => ŠEDA, M.
[title] => Motion Planning Using Voronoi Diagrams
[typ] => PV
[year] => 2003
[id_vav] => 13221
)
)
)
Publikace Rok: 2003
ŠEDA, M., DVOŘÁK, J.
Zobrazeny výsledky 391–405 z 2086