Array
(
[page] => 46
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 21757
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 65404
[vysledek_rok] => 2006
[nazev] => Genetic programming: Parallel grammatical evolution of mathematical function
[nazev_orig] => Genetic programming: Parallel grammatical evolution of mathematical function
[duvernost_udaju_id] => S
[popis] =>
[popis_orig] =>
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 20206
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] =>
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => WEISSER, R.
[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] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[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] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => WEISSER, R. Genetic programming: Parallel grammatical evolution of mathematical function. In Kunovice: 2006.
[citace_html] => WEISSER, R. Genetic programming: Parallel grammatical evolution of mathematical function. In Kunovice: 2006.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT21757,
author="Roman {Weisser}",
title="Genetic programming: Parallel grammatical evolution of mathematical function",
year="2006",
address="Kunovice"
}
[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] => 20206
[oecd_tree_podobor_nazev] => Computer hardware and architecture
[poznamka_metriky] =>
[nazev_en] =>
[popis_en] =>
[klicova_slova_en] =>
[vysledek_datum] => 2006-01-01T00:00:00+01:00
)
[1] => Array
(
[vysledek_id] => 21758
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 65405
[vysledek_rok] => 2007
[nazev] => Algorithms for Objects Description
[nazev_orig] => Algorithms for Objects Description
[duvernost_udaju_id] => S
[popis] => This document deals with two algorihtms for the detection of object boundaries. The first algorithm which is widely used, is called DILATATION-EROSION. The second algorithm is new. This article concentrates on both algorithms and their amenability. Measured speeds of both algorithms are compared too.
[popis_orig] => This document deals with two algorihtms for the detection of object boundaries. The first algorithm which is widely used, is called DILATATION-EROSION. The second algorithm is new. This article concentrates on both algorithms and their amenability. Measured speeds of both algorithms are compared too.
[klicova_slova] => image processing, edge detection, tresholding, image recognition
[klicova_slova_orig] => image processing, edge detection, tresholding, image recognition
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2010-12-03
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => LIŠKA, J.; ŠŤASTNÝ, 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] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[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-7314-084-5
[identifikator_popis] => ISBN - ICSC - International Conference on Soft Computing Applied in Computer and Economic Enviroment
[riv_dodavka_id] => 98
[riv_dodavka_oznaceni] => RIV10-MSM-26210___
[riv_dodavka_rok] => 2010
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => LIŠKA, J.; ŠŤASTNÝ, J. Algorithms for Objects Description. In ICSC - International Conference on Soft Computing Applied in Computer and Economic Enviroment. Kunovice: Evropský polytechnický institut, Kunovice, 2007. 5 p. ISBN: 80-7314-084-5.
[citace_html] => LIŠKA, J.; ŠŤASTNÝ, J. Algorithms for Objects Description. In ICSC - International Conference on Soft Computing Applied in Computer and Economic Enviroment. Kunovice: Evropský polytechnický institut, Kunovice, 2007. 5 p. ISBN: 80-7314-084-5.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT21758,
author="Jiří {Liška} and Jiří {Šťastný}",
title="Algorithms for Objects Description",
booktitle="ICSC - International Conference on Soft Computing Applied in Computer and Economic Enviroment",
year="2007",
pages="5",
publisher="Evropský polytechnický institut, Kunovice",
address="Kunovice",
isbn="80-7314-084-5"
}
[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] => Algorithms for Objects Description
[popis_en] => This document deals with two algorihtms for the detection of object boundaries. The first algorithm which is widely used, is called DILATATION-EROSION. The second algorithm is new. This article concentrates on both algorithms and their amenability. Measured speeds of both algorithms are compared too.
[klicova_slova_en] => image processing, edge detection, tresholding, image recognition
[vysledek_datum] => 2007-01-26T00:00:00+01:00
)
[2] => Array
(
[vysledek_id] => 21761
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 65414
[vysledek_rok] => 2006
[nazev] => PLC (POWER LINE COMMUNICATION)
[nazev_orig] => PLC (POWER LINE COMMUNICATION)
[duvernost_udaju_id] => S
[popis] => Základní požadavky na komunikační systém, možné problémy a jejich možná řešení. Specifikace přenosového media. Využitelné frekvence, modulace a jejich vlastnosti. Základní navrh praktické realizace, použité obvody a programové vybavení.
[popis_orig] => Základní požadavky na komunikační systém, možné problémy a jejich možná řešení. Specifikace přenosového media. Využitelné frekvence, modulace a jejich vlastnosti. Základní navrh praktické realizace, použité obvody a programové vybavení.
[klicova_slova] => PLC, Power line communication, prenos dat
[klicova_slova_orig] => PLC, Power line communication, prenos dat
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] =>
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ORSÁG, Z.; PERNES, P.
[pocet_tvurcu] => 0
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[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] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ORSÁG, Z.; PERNES, P. PLC (POWER LINE COMMUNICATION). In Book of extended abstracts. 2006. 8 s.
[citace_html] => ORSÁG, Z.; PERNES, P. PLC (POWER LINE COMMUNICATION). In Book of extended abstracts. 2006. 8 s.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT21761,
author="Zdeněk {Orság} and Petr {Pernes}",
title="PLC (POWER LINE COMMUNICATION)",
booktitle="Book of extended abstracts",
year="2006",
pages="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] => 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] => PLC (POWER LINE COMMUNICATION)
[popis_en] => Power line communication (PLC) is progresive kind of communication in home automation. Character of this technology is in this article. Folows descritpion modulations and useble frequences. The description of communication module is folow. In conclusion there are used development tools.
[klicova_slova_en] => PLC, Power line communication, data transmition
[vysledek_datum] => 2006-05-15T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 21966
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 65446
[vysledek_rok] => 2006
[nazev] => Optimalizace výrobních dávek v podmínkách neurčitosti
[nazev_orig] => Optimalizace výrobních dávek v podmínkách neurčitosti
[duvernost_udaju_id] => S
[popis] => Příspěvek pojednává o vícestupňovém a vícevýrobkovém problému optimalizace výrobních dávek pro obecné výrobně montážní struktury reprezentované orientovaným acyklickým grafem, kde každý uzel může mít několik předchůdců a následníků. Předpokládáme konečný plánovací horizont složený z diskrétních časových period, dynamické výrobní dávky, několik kapacitně omezených zdrojů a časově proměnné nákladové parametry. Cílem je minimalizace celkových nákladů za daný plánovací horizont. Příspěvek popisuje deterministický model tohoto problému a podává přehled možností jeho úprav pro případ neurčité poptávky po výrobcích.
[popis_orig] => Příspěvek pojednává o vícestupňovém a vícevýrobkovém problému optimalizace výrobních dávek pro obecné výrobně montážní struktury reprezentované orientovaným acyklickým grafem, kde každý uzel může mít několik předchůdců a následníků. Předpokládáme konečný plánovací horizont složený z diskrétních časových period, dynamické výrobní dávky, několik kapacitně omezených zdrojů a časově proměnné nákladové parametry. Cílem je minimalizace celkových nákladů za daný plánovací horizont. Příspěvek popisuje deterministický model tohoto problému a podává přehled možností jeho úprav pro případ neurčité poptávky po výrobcích.
[klicova_slova] => dynamické výrobní dávky, obecná výrobní struktura, neurčitá poptávka
[klicova_slova_orig] => dynamické výrobní dávky, obecná výrobní struktura, neurčitá poptávka
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => HERŮDEK, V.; 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] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[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-210-4083-1
[identifikator_popis] => ISBN - Sborník příspěvků z mezinárodní ekonomické konference Česká ekonomika v procesu globalizace. Sekce Kvantitativní metody a modely v ekonomii.
[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] => HERŮDEK, V.; DVOŘÁK, J. Optimalizace výrobních dávek v podmínkách neurčitosti. In Sborník příspěvků z mezinárodní ekonomické konference Česká ekonomika v procesu globalizace. Sekce Kvantitativní metody a modely v ekonomii. Brno: Masarykova univerzita, 2006. 6 s. ISBN: 80-210-4083-1.
[citace_html] => HERŮDEK, V.; DVOŘÁK, J. Optimalizace výrobních dávek v podmínkách neurčitosti. In Sborník příspěvků z mezinárodní ekonomické konference Česká ekonomika v procesu globalizace. Sekce Kvantitativní metody a modely v ekonomii. Brno: Masarykova univerzita, 2006. 6 s. ISBN: 80-210-4083-1.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT21966,
author="Vladimír {Herůdek} and Jiří {Dvořák}",
title="Optimalizace výrobních dávek v podmínkách neurčitosti",
booktitle="Sborník příspěvků z mezinárodní ekonomické konference Česká ekonomika v procesu globalizace. Sekce Kvantitativní metody a modely v ekonomii.",
year="2006",
number="1",
pages="6",
publisher="Masarykova univerzita",
address="Brno",
isbn="80-210-4083-1"
}
[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] => Optimization of Lot Sizes under Uncertainty
[popis_en] => This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure represented by a directed acyclic network, where each node may have several predecessors and successors. We assume a finite planning horizon consisting of discrete time periods, dynamic lot sizes, multiple constrained resources and time-varying cost parameters. The objective is to minimize the total costs over the planning horizon. The paper describes a deterministic model of this problem and presents a review of possible modifications of this model for uncertain demands.
[klicova_slova_en] => dynamic lot sizes, general product structure, uncertain demands
[vysledek_datum] => 2006-09-01T00:00:00+02:00
)
[4] => Array
(
[vysledek_id] => 21967
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 65447
[vysledek_rok] => 2005
[nazev] => Rozvrhování výroby s omezenými zdroji
[nazev_orig] => Rozvrhování výroby s omezenými zdroji
[duvernost_udaju_id] => S
[popis] => Tento příspěvek se zabývá problematikou rozvrhování zakázkové výroby (job-shop scheduling) se zaměřením na vícezdrojové rozvrhování výroby s flexibilními zdroji. Vychází se z klasických modelu rozvrhování, které se upravují s ohledem na reálné výrobní podmínky. Pro řešení tohoto problému jsou použity moderní heuristické metody, které jsou otestovány na vybraných příkladech.
[popis_orig] => Tento příspěvek se zabývá problematikou rozvrhování zakázkové výroby (job-shop scheduling) se zaměřením na vícezdrojové rozvrhování výroby s flexibilními zdroji. Vychází se z klasických modelu rozvrhování, které se upravují s ohledem na reálné výrobní podmínky. Pro řešení tohoto problému jsou použity moderní heuristické metody, které jsou otestovány na vybraných příkladech.
[klicova_slova] => rozvrhování zakázkové výroby, omezené zdroje, heuristické metody
[klicova_slova_orig] => rozvrhování zakázkové výroby, omezené zdroje, heuristické metody
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] => 2011-05-17
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => HERŮDEK, V.
[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] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[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-248-0951-6
[identifikator_popis] => ISBN - Sborník ze 14. semináře Matematické metody v inženýrství
[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] => HERŮDEK, V. Rozvrhování výroby s omezenými zdroji. In Sborník ze 14. semináře Matematické metody v inženýrství. Ostrava: VŠB - Technická univerzita Ostrava, 2005. 5 s. ISBN: 80-248-0951-6.
[citace_html] => HERŮDEK, V. Rozvrhování výroby s omezenými zdroji. In Sborník ze 14. semináře Matematické metody v inženýrství. Ostrava: VŠB - Technická univerzita Ostrava, 2005. 5 s. ISBN: 80-248-0951-6.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT21967,
author="Vladimír {Herůdek}",
title="Rozvrhování výroby s omezenými zdroji",
booktitle="Sborník ze 14. semináře Matematické metody v inženýrství",
year="2005",
number="1",
pages="5",
publisher="VŠB - Technická univerzita Ostrava",
address="Ostrava",
isbn="80-248-0951-6"
}
[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] => Production Scheduling with Constrained Resources
[popis_en] => This paper deals with a job shop scheduling problem with a view to multiresource production scheduling with resource flexibility. We start from classical scheduling models and modify them with respect to real-life production conditions. We use modern heuristic methods for solving this problem and we test these methods on selected examples.
[klicova_slova_en] => job shop scheduling, constrained resources, heuristic methods
[vysledek_datum] => 2005-01-01T00:00:00+01:00
)
[5] => Array
(
[vysledek_id] => 22023
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 65549
[vysledek_rok] => 2007
[nazev] => Některé aktuální problémy hromadné dopravy, související se vzájemnou spoluprací regionů
[nazev_orig] => Některé aktuální problémy hromadné dopravy, související se vzájemnou spoluprací regionů
[duvernost_udaju_id] => S
[popis] => Formulace problémů operačního výzkumu z oblasti dopravy, k výuce na vysokých školách a ke strategickému rozhodování ve veřejné správě by měla přispívat k podpoře ekologicky příznivých forem dopravy. Článek přináší rozbor některých skutečností, které v současné době brání efektivnímu využívání železniční dopravy jako meziregionálního pojítka a faktoru pro zvyšování integrity území státu, a naznačuje možné cesty k jejich odstranění.
[popis_orig] => Formulace problémů operačního výzkumu z oblasti dopravy, k výuce na vysokých školách a ke strategickému rozhodování ve veřejné správě by měla přispívat k podpoře ekologicky příznivých forem dopravy. Článek přináší rozbor některých skutečností, které v současné době brání efektivnímu využívání železniční dopravy jako meziregionálního pojítka a faktoru pro zvyšování integrity území státu, a naznačuje možné cesty k jejich odstranění.
[klicova_slova] => Železniční doprava, osobní vlaky, tvorba jízdních řádů, spádové oblasti krajů, optimalizační problémy operačního výzkumu
[klicova_slova_orig] => Železniční doprava, osobní vlaky, tvorba jízdních řádů, spádové oblasti krajů, optimalizační problémy operačního výzkumu
[url] => http://www.czechuniversity.com/dokumenty/konference/2007/SBORNIK.pdf#page=211
[oecd_obor_id] => 50702
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => cs
[schvalil_id] => 999999
[schvaleno] =>
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => KLAPKA, J.
[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] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[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 978-80-7314-111-0
[identifikator_popis] => ISBN - Sborník "Jak úspěšně podnikat v příhraničních regionech jihovýchodní Moravy" III. Mezinárodní konference 2007
[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] => KLAPKA, J. Některé aktuální problémy hromadné dopravy, související se vzájemnou spoluprací regionů. In Sborník "Jak úspěšně podnikat v příhraničních regionech jihovýchodní Moravy" III. Mezinárodní konference 2007. Kunovice: EPI Kunovice, 2007. s. 211-213. ISBN: 978-80-7314-111-0.
[citace_html] => KLAPKA, J. Některé aktuální problémy hromadné dopravy, související se vzájemnou spoluprací regionů. In Sborník "Jak úspěšně podnikat v příhraničních regionech jihovýchodní Moravy" III. Mezinárodní konference 2007. Kunovice: EPI Kunovice, 2007. s. 211-213. ISBN: 978-80-7314-111-0.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT22023,
author="Jindřich {Klapka}",
title="Některé aktuální problémy hromadné dopravy, související se vzájemnou spoluprací regionů",
booktitle="Sborník {"}Jak úspěšně podnikat v příhraničních regionech jihovýchodní Moravy{"} III. Mezinárodní konference 2007",
year="2007",
pages="211--213",
publisher="EPI Kunovice",
address="Kunovice",
isbn="978-80-7314-111-0",
url="http://www.czechuniversity.com/dokumenty/konference/2007/SBORNIK.pdf#page=211"
}
[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] => 50000
[oecd_tree_oblast_nazev] => 5. Social Sciences
[oecd_tree_obor_id] => 50700
[oecd_tree_obor_nazev] => 5.7 Social and economic geography
[oecd_tree_podobor_id] => 50702
[oecd_tree_podobor_nazev] => Urban studies (planning and development)
[poznamka_metriky] =>
[nazev_en] => Some Topical Problems of Public Transport Connected with the Mutual Collaboration of Regions
[popis_en] => The formulation of the problems of the Operations Research in the domain of transportation, for the education at universities and for the strategic decision in the public administration should contribute to the support of ecologically favourable forms of transportation. The paper presents the analysis of some facts that at the present time hinders the effective utilization of the railway traffic as the inter-regional link and as a factor of increasing the integrity of the management of the country and shows us possible ways for their cancellation.
[klicova_slova_en] => Railway service, passenger-trains, train schedule creation, subregions, operations research optimisation problems
[vysledek_datum] => 2007-01-01T00:00:00+01:00
)
[6] => Array
(
[vysledek_id] => 22393
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 67224
[vysledek_rok] => 2007
[nazev] => The Scheduling of Manufacturing Processes
[nazev_orig] => The Scheduling of Manufacturing Processes
[duvernost_udaju_id] => S
[popis] => The scheduling of manufacturing processes aims to find sequences of jobs on given machines optimal by a selected criterion such as minimal completion time of all operations, minimal losses caused by exceeding the required completion times, minimal sum of machine idle times, etc. In the paper, a mathematical model of the job shop scheduling problem is derived and suitable representations are mentioned for solving it by heuristic methods, due to the fact that this combinatorial problem is NP-complete and exact solutions can only be gained in a reasonable time for small instances.
[popis_orig] => The scheduling of manufacturing processes aims to find sequences of jobs on given machines optimal by a selected criterion such as minimal completion time of all operations, minimal losses caused by exceeding the required completion times, minimal sum of machine idle times, etc. In the paper, a mathematical model of the job shop scheduling problem is derived and suitable representations are mentioned for solving it by heuristic methods, due to the fact that this combinatorial problem is NP-complete and exact solutions can only be gained in a reasonable time for small instances.
[klicova_slova] => manufacturing process, flow shop scheduling, job shop scheduling
[klicova_slova_orig] => manufacturing process, flow shop scheduling, job shop scheduling
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] =>
[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] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[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 978-80-8073-758-0
[identifikator_popis] => ISBN - Sborník příspěvků workshopu Automatizácia a riadenie v teórii a praxi ARTEP 2007
[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. The Scheduling of Manufacturing Processes. In Sborník příspěvků workshopu Automatizácia a riadenie v teórii a praxi ARTEP 2007. Stará Lesná (Slovakia): TU Košice, 2007. p. 7-1 (7-6 p.)ISBN: 978-80-8073-758-0.
[citace_html] => ŠEDA, M. The Scheduling of Manufacturing Processes. In Sborník příspěvků workshopu Automatizácia a riadenie v teórii a praxi ARTEP 2007. Stará Lesná (Slovakia): TU Košice, 2007. p. 7-1 (7-6 p.)ISBN: 978-80-8073-758-0.
[citace_rtf] =>
[citace_bibtex] =>
[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] => The Scheduling of Manufacturing Processes
[popis_en] => The scheduling of manufacturing processes aims to find sequences of jobs on given machines optimal by a selected criterion such as minimal completion time of all operations, minimal losses caused by exceeding the required completion times, minimal sum of machine idle times, etc. In the paper, a mathematical model of the job shop scheduling problem is derived and suitable representations are mentioned for solving it by heuristic methods, due to the fact that this combinatorial problem is NP-complete and exact solutions can only be gained in a reasonable time for small instances.
[klicova_slova_en] => manufacturing process, flow shop scheduling, job shop scheduling
[vysledek_datum] => 2007-02-01T00:00:00+01:00
)
[7] => Array
(
[vysledek_id] => 22394
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 67226
[vysledek_rok] => 2007
[nazev] => Roadmap Methods vs. Cell Decomposition in Robot Motion Planning
[nazev_orig] => Roadmap Methods vs. Cell Decomposition in Robot Motion Planning
[duvernost_udaju_id] => S
[popis] => The task of planning trajectories plays an important role in transportation, robotics, information systems (sending messages), etc. In robot motion planning, the robot should pass around 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. Research on path planning has yielded many fundamentally different approaches to the solution of this problem that can be classified as roadmap methods (visibility graph method, Voronoi diagram) and methods based on cell decomposition. Assuming movements only in a restricted number of directions (eight directional or horizontal/vertical) the task, with respect to its combinatorial nature, can be solved by decomposition methods using heuristic techniques. We present drawbacks of this approach (combinatorial explosion, limited granularity and generating infeasible solutions). Then, using the Voronoi diagrams, we need only polynomial time for finding a solution and, choosing a 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, information systems (sending messages), etc. In robot motion planning, the robot should pass around 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. Research on path planning has yielded many fundamentally different approaches to the solution of this problem that can be classified as roadmap methods (visibility graph method, Voronoi diagram) and methods based on cell decomposition. Assuming movements only in a restricted number of directions (eight directional or horizontal/vertical) the task, with respect to its combinatorial nature, can be solved by decomposition methods using heuristic techniques. We present drawbacks of this approach (combinatorial explosion, limited granularity and generating infeasible solutions). Then, using the Voronoi diagrams, we need only polynomial time for finding a solution and, choosing a Euclidean or rectilinear metric, it can be adapted to tasks with general or directional-constrained movements
[klicova_slova] => motion planning, cell decomposition, roadmap methods, visibility graph, Voronoi diagram
[klicova_slova_orig] => motion planning, cell decomposition, roadmap methods, visibility graph, Voronoi diagram
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] =>
[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] => Publication results
[druh_nazev] => Paper in proceedings (conference paper)
[druh_popis] => Paper in proceedings (conference paper)
[stav] => Approved
[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 978-960-8457-59-1
[identifikator_popis] => ISBN - Proceedings of the 6th WSEAS International Conference on Signal Processing, Robotics and Automation ISPRA '07
[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. Roadmap Methods vs. Cell Decomposition in Robot Motion Planning. In Proceedings of the 6th WSEAS International Conference on Signal Processing, Robotics and Automation ISPRA '07. Corfu Island (Greece): WSEAS Press, 2007. p. 127-132. ISBN: 978-960-8457-59-1.
[citace_html] => ŠEDA, M. Roadmap Methods vs. Cell Decomposition in Robot Motion Planning. In Proceedings of the 6th WSEAS International Conference on Signal Processing, Robotics and Automation ISPRA '07. Corfu Island (Greece): WSEAS Press, 2007. p. 127-132. ISBN: 978-960-8457-59-1.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT22394,
author="Miloš {Šeda}",
title="Roadmap Methods vs. Cell Decomposition in Robot Motion Planning",
booktitle="Proceedings of the 6th WSEAS International Conference on Signal Processing, Robotics and Automation ISPRA '07",
year="2007",
pages="127--132",
publisher="WSEAS Press",
address="Corfu Island (Greece)",
isbn="978-960-8457-59-1"
}
[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] => Roadmap Methods vs. Cell Decomposition in Robot Motion Planning
[popis_en] => The task of planning trajectories plays an important role in transportation, robotics, information systems (sending messages), etc. In robot motion planning, the robot should pass around 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. Research on path planning has yielded many fundamentally different approaches to the solution of this problem that can be classified as roadmap methods (visibility graph method, Voronoi diagram) and methods based on cell decomposition. Assuming movements only in a restricted number of directions (eight directional or horizontal/vertical) the task, with respect to its combinatorial nature, can be solved by decomposition methods using heuristic techniques. We present drawbacks of this approach (combinatorial explosion, limited granularity and generating infeasible solutions). Then, using the Voronoi diagrams, we need only polynomial time for finding a solution and, choosing a Euclidean or rectilinear metric, it can be adapted to tasks with general or directional-constrained movements
[klicova_slova_en] => motion planning, cell decomposition, roadmap methods, visibility graph, Voronoi diagram
[vysledek_datum] => 2007-02-15T00:00:00+01:00
)
)
)