Array
(
[page] => 42
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 20274
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 63088
[vysledek_rok] => 2006
[nazev] => Analýza komunikace výzkum - praxe
[nazev_orig] => Analýza komunikace výzkum - praxe
[duvernost_udaju_id] => S
[popis] => Příspěvek analyzuje nedostatky v komunikaci mezi vysokými školami a praxí. V závěru uvádí doporučení na zlepšení stávající situace
[popis_orig] => Příspěvek analyzuje nedostatky v komunikaci mezi vysokými školami a praxí. V závěru uvádí doporučení na zlepšení stávající situace
[klicova_slova] => výzkum, praxe, komunikace, nedostatky
[klicova_slova_orig] => výzkum, praxe, komunikace, nedostatky
[url] =>
[oecd_obor_id] => 10201
[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] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => LACKO, B.
[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-86771-15-6
[identifikator_popis] => ISBN - Systémová komunikace - Sborník XXXVIII. vědecké konference SI2006
[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] => LACKO, B. Analýza komunikace výzkum - praxe. In Systémová komunikace - Sborník XXXVIII. vědecké konference SI2006. Hradec Králové: Univerzita Hradec Králové, 2006. 8 s. ISBN: 80-86771-15-6.
[citace_html] => LACKO, B. Analýza komunikace výzkum - praxe. In Systémová komunikace - Sborník XXXVIII. vědecké konference SI2006. Hradec Králové: Univerzita Hradec Králové, 2006. 8 s. ISBN: 80-86771-15-6.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20274,
author="Branislav {Lacko}",
title="Analýza komunikace výzkum - praxe",
booktitle="Systémová komunikace - Sborník XXXVIII. vědecké konference SI2006",
year="2006",
number="1. vydání",
pages="8",
publisher="Univerzita Hradec Králové",
address="Hradec Králové",
isbn="80-86771-15-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] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => Analysis communication research-practice
[popis_en] => Problem of communication research-practice are described
[klicova_slova_en] => communication, research, practice
[vysledek_datum] => 2006-04-19T00:00:00+02:00
)
[1] => Array
(
[vysledek_id] => 20351
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 62362
[vysledek_rok] => 2006
[nazev] => Mathematical Models and Representation Schemes of Manufacturing Processes
[nazev_orig] => Mathematical Models and Representation Schemes of Manufacturing Processes
[duvernost_udaju_id] => S
[popis] => In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem by stochastic heuristic methods. For the job shop scheduling problem, a mathematical model and its main representation schemes are presented.
[popis_orig] => In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem by stochastic heuristic methods. For the job shop scheduling problem, a mathematical model and its main representation schemes are presented.
[klicova_slova] => manufacturing processes, flow shop, job shop, representation scheme
[klicova_slova_orig] => manufacturing processes, flow shop, job shop, representation scheme
[url] =>
[oecd_obor_id] => 10201
[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] => 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] => 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-969224-6-7
[identifikator_popis] => ISBN - Proceedings of the Conference Modern Trends in Control: International Study in Automatic Control ISAC 2006
[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. Mathematical Models and Representation Schemes of Manufacturing Processes. In Proceedings of the Conference Modern Trends in Control: International Study in Automatic Control ISAC 2006. Košice: Equilibria, Košice, 2006. 9 p. ISBN: 80-969224-6-7.
[citace_html] => ŠEDA, M. Mathematical Models and Representation Schemes of Manufacturing Processes. In Proceedings of the Conference Modern Trends in Control: International Study in Automatic Control ISAC 2006. Košice: Equilibria, Košice, 2006. 9 p. ISBN: 80-969224-6-7.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20351,
author="Miloš {Šeda}",
title="Mathematical Models and Representation Schemes of Manufacturing Processes",
booktitle="Proceedings of the Conference Modern Trends in Control: International Study in Automatic Control ISAC 2006",
year="2006",
pages="9",
publisher="Equilibria, Košice",
address="Košice",
isbn="80-969224-6-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] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => Mathematical Models and Representation Schemes of Manufacturing Processes
[popis_en] => In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem by stochastic heuristic methods. For the job shop scheduling problem, a mathematical model and its main representation schemes are presented.
[klicova_slova_en] => manufacturing processes, flow shop, job shop, representation scheme
[vysledek_datum] => 2006-07-01T00:00:00+02:00
)
[2] => Array
(
[vysledek_id] => 20352
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 62363
[vysledek_rok] => 2006
[nazev] => Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems
[nazev_orig] => Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems
[duvernost_udaju_id] => S
[popis] => This paper describes a new technique for solving the duration minimization in a resource-constrained network. It is based on a transformation of the resource-constrained project scheduling problem (RCPSP) to a sequence of (multi)knapsack problem (MKP) solutions. In the first part, three deterministic approaches are summarized and their time complexity is discussed. Due to the combinatorial nature of the problem for large projects with many constraints, heuristic techniques are applied. A genetic algorithm approach is proposed and compared with simulated annealing.
[popis_orig] => This paper describes a new technique for solving the duration minimization in a resource-constrained network. It is based on a transformation of the resource-constrained project scheduling problem (RCPSP) to a sequence of (multi)knapsack problem (MKP) solutions. In the first part, three deterministic approaches are summarized and their time complexity is discussed. Due to the combinatorial nature of the problem for large projects with many constraints, heuristic techniques are applied. A genetic algorithm approach is proposed and compared with simulated annealing.
[klicova_slova] => Resource-Constrained Project Scheduling Problem, Multi-Knapsack Problem
[klicova_slova_orig] => Resource-Constrained Project Scheduling Problem, Multi-Knapsack Problem
[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] => 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] => 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 960-8457-47-5
[identifikator_popis] => ISBN - Proceedings of the 10th WSEAS International Conference on Computers
[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. Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems. In Proceedings of the 10th WSEAS International Conference on Computers. Athens: WSEAS, 2006. 7 p. ISBN: 960-8457-47-5.
[citace_html] => ŠEDA, M. Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems. In Proceedings of the 10th WSEAS International Conference on Computers. Athens: WSEAS, 2006. 7 p. ISBN: 960-8457-47-5.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20352,
author="Miloš {Šeda}",
title="Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems",
booktitle="Proceedings of the 10th WSEAS International Conference on Computers",
year="2006",
pages="7",
publisher="WSEAS",
address="Athens",
isbn="960-8457-47-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] => 20206
[oecd_tree_podobor_nazev] => Computer hardware and architecture
[poznamka_metriky] =>
[nazev_en] => Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems
[popis_en] => This paper describes a new technique for solving the duration minimization in a resource-constrained network. It is based on a transformation of the resource-constrained project scheduling problem (RCPSP) to a sequence of (multi)knapsack problem (MKP) solutions. In the first part, three deterministic approaches are summarized and their time complexity is discussed. Due to the combinatorial nature of the problem for large projects with many constraints, heuristic techniques are applied. A genetic algorithm approach is proposed and compared with simulated annealing.
[klicova_slova_en] => Resource-Constrained Project Scheduling Problem, Multi-Knapsack Problem
[vysledek_datum] => 2006-07-01T00:00:00+02:00
)
[3] => Array
(
[vysledek_id] => 20353
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 62364
[vysledek_rok] => 2006
[nazev] => Relaxation of Roadmap Methods of Robot Motion Planning
[nazev_orig] => Relaxation of Roadmap Methods of Robot Motion Planning
[duvernost_udaju_id] => S
[popis] => In robot motion planning a 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 that can be classified as roadmap methods (visibility graph method, Voronoi diagram) and methods based on cell decomposition. In this work, an approach based on Voronoi diagrams is proposed, considering point, straight line and polygonal obstacles in a completely known scene. Approximating polygonal obstacles by sets of points makes it possible to apply roadmap methods to more complex problems.
[popis_orig] => In robot motion planning a 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 that can be classified as roadmap methods (visibility graph method, Voronoi diagram) and methods based on cell decomposition. In this work, an approach based on Voronoi diagrams is proposed, considering point, straight line and polygonal obstacles in a completely known scene. Approximating polygonal obstacles by sets of points makes it possible to apply roadmap methods to more complex problems.
[klicova_slova] => robot motion planning, roadmap methods, Voronoi diagram
[klicova_slova_orig] => robot motion planning, roadmap methods, Voronoi diagram
[url] =>
[oecd_obor_id] => 10201
[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] => 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] => 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 960-8457-47-5
[identifikator_popis] => ISBN - Proceedings of the 10th WSEAS International Conference on Systems
[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. Relaxation of Roadmap Methods of Robot Motion Planning. In Proceedings of the 10th WSEAS International Conference on Systems. Athens: WSEAS, 2006. 6 p. ISBN: 960-8457-47-5.
[citace_html] => ŠEDA, M. Relaxation of Roadmap Methods of Robot Motion Planning. In Proceedings of the 10th WSEAS International Conference on Systems. Athens: WSEAS, 2006. 6 p. ISBN: 960-8457-47-5.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20353,
author="Miloš {Šeda}",
title="Relaxation of Roadmap Methods of Robot Motion Planning",
booktitle="Proceedings of the 10th WSEAS International Conference on Systems",
year="2006",
pages="6",
publisher="WSEAS",
address="Athens",
isbn="960-8457-47-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] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => Relaxation of Roadmap Methods of Robot Motion Planning
[popis_en] => In robot motion planning a 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 that can be classified as roadmap methods (visibility graph method, Voronoi diagram) and methods based on cell decomposition. In this work, an approach based on Voronoi diagrams is proposed, considering point, straight line and polygonal obstacles in a completely known scene. Approximating polygonal obstacles by sets of points makes it possible to apply roadmap methods to more complex problems.
[klicova_slova_en] => robot motion planning, roadmap methods, Voronoi diagram
[vysledek_datum] => 2006-07-01T00:00:00+02:00
)
[4] => Array
(
[vysledek_id] => 20354
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 62365
[vysledek_rok] => 2006
[nazev] => Solving Fuzzy Network Optimisation Problems
[nazev_orig] => Solving Fuzzy Network Optimisation Problems
[duvernost_udaju_id] => S
[popis] => In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. We propose a modification of the shortest paths approximation based on the fuzzy shortest paths (FSP) evaluations. Since fuzzy min operation using the extension principle leads to nondominated solutions, we propose another approach to solving the FSP using Cheng's centroid point fuzzy ranking method. We also show that the efficiency of computations, in specific problems, may be improved by suitable data structures.
[popis_orig] => In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. We propose a modification of the shortest paths approximation based on the fuzzy shortest paths (FSP) evaluations. Since fuzzy min operation using the extension principle leads to nondominated solutions, we propose another approach to solving the FSP using Cheng's centroid point fuzzy ranking method. We also show that the efficiency of computations, in specific problems, may be improved by suitable data structures.
[klicova_slova] => minimum spanning tree, Steiner tree, heuristics, fuzzy number
[klicova_slova_orig] => minimum spanning tree, Steiner tree, heuristics, fuzzy number
[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] => 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] => 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 3-9808089-8-X
[identifikator_popis] => ISBN - Proceedings of the 13th Fuzzy Colloquium
[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. Solving Fuzzy Network Optimisation Problems. In Proceedings of the 13th Fuzzy Colloquium. Zittau: University of Applied Sciences, Zittau, 2006. p. 221-228. ISBN: 3-9808089-8-X.
[citace_html] => ŠEDA, M. Solving Fuzzy Network Optimisation Problems. In Proceedings of the 13th Fuzzy Colloquium. Zittau: University of Applied Sciences, Zittau, 2006. p. 221-228. ISBN: 3-9808089-8-X.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20354,
author="Miloš {Šeda}",
title="Solving Fuzzy Network Optimisation Problems",
booktitle="Proceedings of the 13th Fuzzy Colloquium",
year="2006",
pages="221--228",
publisher="University of Applied Sciences, Zittau",
address="Zittau",
isbn="3-9808089-8-X"
}
[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] => Solving Fuzzy Network Optimisation Problems
[popis_en] => In this paper, we deal with the Steiner tree problem (STP) on a graph in which a fuzzy number, instead of a real number, is assigned to each edge. We propose a modification of the shortest paths approximation based on the fuzzy shortest paths (FSP) evaluations. Since fuzzy min operation using the extension principle leads to nondominated solutions, we propose another approach to solving the FSP using Cheng's centroid point fuzzy ranking method. We also show that the efficiency of computations, in specific problems, may be improved by suitable data structures.
[klicova_slova_en] => minimum spanning tree, Steiner tree, heuristics, fuzzy number
[vysledek_datum] => 2006-09-01T00:00:00+02:00
)
[5] => Array
(
[vysledek_id] => 20369
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 62399
[vysledek_rok] => 2006
[nazev] => Evaluation of pressure from film thickness within EHL contact with dented surfaces
[nazev_orig] => Evaluation of pressure from film thickness within EHL contact with dented surfaces
[duvernost_udaju_id] => S
[popis] => Lubricant film thickness distribution within the whole concentrated smooth or dented contact is evaluated from chromatic interferograms by thin film colorimetric interferometry. Consequently, measured film thickness is used to determine the distribution of pressure in EHL contact. EHL film thickness measurements were made using a modified version of the automatic system for the real-time evaluation of EHL film thickness. Inverse elasticity theory approach was used in order to calculate the distribution of the contact pressure from film thickness.
[popis_orig] => Lubricant film thickness distribution within the whole concentrated smooth or dented contact is evaluated from chromatic interferograms by thin film colorimetric interferometry. Consequently, measured film thickness is used to determine the distribution of pressure in EHL contact. EHL film thickness measurements were made using a modified version of the automatic system for the real-time evaluation of EHL film thickness. Inverse elasticity theory approach was used in order to calculate the distribution of the contact pressure from film thickness.
[klicova_slova] => Tribology, elastohydrodynamic lubrication (EHD), colorimetric interferometry, film thickness, elastic deformation, inverse elasticity theory, convolution, contact pressure, dent
[klicova_slova_orig] => Tribology, elastohydrodynamic lubrication (EHD), colorimetric interferometry, film thickness, elastic deformation, inverse elasticity theory, convolution, contact pressure, dent
[url] =>
[oecd_obor_id] => 20301
[odpovedny_utvar_id] => 170
[odpovedny_utvar_nazev] => Dept. of Machine Design
[odpovedny_utvar_zkratka] => IMD DMD
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => VRBKA, M.; VAVERKA, M.; POLIŠČUK, R.; KŘUPKA, I.; HARTL, M.; URBANEC, L.
[pocet_tvurcu] => 6
[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 88-902333-0-3
[identifikator_popis] => ISBN - AITC-AIT 2006 5th International Conference of Tribology
[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] => VRBKA, M.; VAVERKA, M.; POLIŠČUK, R.; KŘUPKA, I.; HARTL, M.; URBANEC, L. Evaluation of pressure from film thickness within EHL contact with dented surfaces. In AITC-AIT 2006 5th International Conference of Tribology. Parma, Itálie: 2006. p. 1-11. ISBN: 88-902333-0-3.
[citace_html] => VRBKA, M.; VAVERKA, M.; POLIŠČUK, R.; KŘUPKA, I.; HARTL, M.; URBANEC, L. Evaluation of pressure from film thickness within EHL contact with dented surfaces. In AITC-AIT 2006 5th International Conference of Tribology. Parma, Itálie: 2006. p. 1-11. ISBN: 88-902333-0-3.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20369,
author="Martin {Vrbka} and Michal {Vaverka} and Radek {Poliščuk} and Ivan {Křupka} and Martin {Hartl} and Libor {Urbanec}",
title="Evaluation of pressure from film thickness within EHL contact with dented surfaces",
booktitle="AITC-AIT 2006 5th International Conference of Tribology",
year="2006",
pages="1--11",
address="Parma, Itálie",
isbn="88-902333-0-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] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20300
[oecd_tree_obor_nazev] => 2.3 Mechanical engineering
[oecd_tree_podobor_id] => 20301
[oecd_tree_podobor_nazev] => Mechanical engineering
[poznamka_metriky] =>
[nazev_en] => Evaluation of pressure from film thickness within EHL contact with dented surfaces
[popis_en] => Lubricant film thickness distribution within the whole concentrated smooth or dented contact is evaluated from chromatic interferograms by thin film colorimetric interferometry. Consequently, measured film thickness is used to determine the distribution of pressure in EHL contact. EHL film thickness measurements were made using a modified version of the automatic system for the real-time evaluation of EHL film thickness. Inverse elasticity theory approach was used in order to calculate the distribution of the contact pressure from film thickness.
[klicova_slova_en] => Tribology, elastohydrodynamic lubrication (EHD), colorimetric interferometry, film thickness, elastic deformation, inverse elasticity theory, convolution, contact pressure, dent
[vysledek_datum] => 2006-09-20T00:00:00+02:00
)
[6] => Array
(
[vysledek_id] => 20475
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 55303
[vysledek_rok] => 2005
[nazev] => Motion Planning in the Plane Using Voronoi Diagrams
[nazev_orig] => Motion Planning in the Plane Using Voronoi Diagrams
[duvernost_udaju_id] => S
[popis] => 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. In contrast to this approach, an application of the Voronoi diagrams needs only polynomial time and choosing Euclidean or rectilinear metric it can be adapted to tasks with general or directional-constrained movements.
[popis_orig] => 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. In contrast to this approach, an application of the Voronoi diagrams 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] => 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] => 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] => 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 973-27-1254-6
[identifikator_popis] => ISBN - Proceedings of the 4th International Conference on Advanced Manufacturing Technologies ICAMaT 2005
[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 in the Plane Using Voronoi Diagrams. In Proceedings of the 4th International Conference on Advanced Manufacturing Technologies ICAMaT 2005. Bucuresti (Romania): Editura Academiei Romane, 2005. 6 p. ISBN: 973-27-1254-6.
[citace_html] => ŠEDA, M. Motion Planning in the Plane Using Voronoi Diagrams. In Proceedings of the 4th International Conference on Advanced Manufacturing Technologies ICAMaT 2005. Bucuresti (Romania): Editura Academiei Romane, 2005. 6 p. ISBN: 973-27-1254-6.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20475,
author="Miloš {Šeda}",
title="Motion Planning in the Plane Using Voronoi Diagrams",
booktitle="Proceedings of the 4th International Conference on Advanced Manufacturing Technologies ICAMaT 2005",
year="2005",
pages="6",
publisher="Editura Academiei Romane",
address="Bucuresti (Romania)",
isbn="973-27-1254-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] => Motion Planning in the Plane Using Voronoi Diagrams
[popis_en] => 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. In contrast to this approach, an application of the Voronoi diagrams 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, roadmap method, computational geometry, visibility graph, Voronoi diagram
[vysledek_datum] => 2005-11-03T00:00:00+01:00
)
[7] => Array
(
[vysledek_id] => 20504
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 55349
[vysledek_rok] => 2005
[nazev] => Self-learning Controller of Active Magnetic Bearing Based on CARLA method
[nazev_orig] => Self-learning Controller of Active Magnetic Bearing Based on CARLA method
[duvernost_udaju_id] => S
[popis] => The active magnetic bearing control through analytically designed linear PD regulator, with parallel nonlinear compensation represented by automatic approximator is described in this contribution. Coefficient (parameter) values come from actions of Continuous Action Reinforcement Learning Automata (CARLAs). Influence of CARLAs parameters to learning is discused. Parameters influence is proved by simulation study. It is shown that improvement of learning can be reached by selecting apropriate parameters of learning.
[popis_orig] => The active magnetic bearing control through analytically designed linear PD regulator, with parallel nonlinear compensation represented by automatic approximator is described in this contribution. Coefficient (parameter) values come from actions of Continuous Action Reinforcement Learning Automata (CARLAs). Influence of CARLAs parameters to learning is discused. Parameters influence is proved by simulation study. It is shown that improvement of learning can be reached by selecting apropriate parameters of learning.
[klicova_slova] =>
[klicova_slova_orig] =>
[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] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => Březina, T., Turek, M., Pulchart, J.
[pocet_tvurcu] => 3
[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 83-905409-3-2
[identifikator_popis] => ISBN - Proceedings
[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] => Březina, T., Turek, M., Pulchart, J. Self-learning Controller of Active Magnetic Bearing Based on CARLA method. In Proceedings. Warszawa: 2005. p. 17-22. ISBN: 83-905409-3-2.
[citace_html] => Březina, T., Turek, M., Pulchart, J. Self-learning Controller of Active Magnetic Bearing Based on CARLA method. In Proceedings. Warszawa: 2005. p. 17-22. ISBN: 83-905409-3-2.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20504,
author="Tomáš {Březina} and Milan {Turek} and Jaroslav {Pulchart}",
title="Self-learning Controller of Active Magnetic Bearing Based on CARLA method",
booktitle="Proceedings",
year="2005",
pages="17--22",
address="Warszawa",
isbn="83-905409-3-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] => Self-learning Controller of Active Magnetic Bearing Based on CARLA method
[popis_en] => The active magnetic bearing control through analytically designed linear PD regulator, with parallel nonlinear compensation represented by automatic approximator is described in this contribution. Coefficient (parameter) values come from actions of Continuous Action Reinforcement Learning Automata (CARLAs). Influence of CARLAs parameters to learning is discused. Parameters influence is proved by simulation study. It is shown that improvement of learning can be reached by selecting apropriate parameters of learning.
[klicova_slova_en] => active magnetic bearing
[vysledek_datum] => 2005-12-31T00:00:00+01:00
)
[8] => Array
(
[vysledek_id] => 20505
[vysledek_druh_id] => CONPA
[ex_vysledek_id] => 55351
[vysledek_rok] => 2005
[nazev] => SOME NOTES ON CONTROL OF ASYNCHRONOUS ELECTROMOTOR BY IMPROVED CARLA METHOD
[nazev_orig] => SOME NOTES ON CONTROL OF ASYNCHRONOUS ELECTROMOTOR BY IMPROVED CARLA METHOD
[duvernost_udaju_id] => S
[popis] => Modifications of reinforcement learning algorithm, so called continuous action reinforcement learning automaton (CARLA), are presented in this contribution. Automaton learning algorithm is based on rewarding that gradually evolves the set of probability densities. This set is consequently used for action set determination. Modifications consist of improving learning parameters based on learned values. Thereby higher values of probability density near the best action are reached and therefore the variance of chosen actions is lower than original. The influence of modifications is proved by simulation study describing learning and behavior of asynchronous electromotor scalar control. Standard PSD controller is used whose parameter values represent actions of three independent automata. The goal of on line learning process is to minimize the mean square of control error. Here described modifications of algorithm allow the improvement of quality of revolutions control with preserving basic algorithm characteristics.
[popis_orig] => Modifications of reinforcement learning algorithm, so called continuous action reinforcement learning automaton (CARLA), are presented in this contribution. Automaton learning algorithm is based on rewarding that gradually evolves the set of probability densities. This set is consequently used for action set determination. Modifications consist of improving learning parameters based on learned values. Thereby higher values of probability density near the best action are reached and therefore the variance of chosen actions is lower than original. The influence of modifications is proved by simulation study describing learning and behavior of asynchronous electromotor scalar control. Standard PSD controller is used whose parameter values represent actions of three independent automata. The goal of on line learning process is to minimize the mean square of control error. Here described modifications of algorithm allow the improvement of quality of revolutions control with preserving basic algorithm characteristics.
[klicova_slova] =>
[klicova_slova_orig] =>
[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] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => Turek, M., Březina, T., Pulchart, 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 80-85918-93-5
[identifikator_popis] => ISBN - Book of extended abstracts
[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] => Turek, M., Březina, T., Pulchart, J. SOME NOTES ON CONTROL OF ASYNCHRONOUS ELECTROMOTOR BY IMPROVED CARLA METHOD. In Book of extended abstracts. Academy of Sciences of the Czech Republic, Prague: 2005. p. 315-316. ISBN: 80-85918-93-5.
[citace_html] => Turek, M., Březina, T., Pulchart, J. SOME NOTES ON CONTROL OF ASYNCHRONOUS ELECTROMOTOR BY IMPROVED CARLA METHOD. In Book of extended abstracts. Academy of Sciences of the Czech Republic, Prague: 2005. p. 315-316. ISBN: 80-85918-93-5.
[citace_rtf] =>
[citace_bibtex] => @inproceedings{BUT20505,
author="Milan {Turek} and Tomáš {Březina} and Jaroslav {Pulchart}",
title="SOME NOTES ON CONTROL OF ASYNCHRONOUS ELECTROMOTOR BY IMPROVED CARLA METHOD",
booktitle="Book of extended abstracts",
year="2005",
pages="315--316",
address="Academy of Sciences of the Czech Republic, Prague",
isbn="80-85918-93-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] => SOME NOTES ON CONTROL OF ASYNCHRONOUS ELECTROMOTOR BY IMPROVED CARLA METHOD
[popis_en] => Modifications of reinforcement learning algorithm, so called continuous action reinforcement learning automaton (CARLA), are presented in this contribution. Automaton learning algorithm is based on rewarding that gradually evolves the set of probability densities. This set is consequently used for action set determination. Modifications consist of improving learning parameters based on learned values. Thereby higher values of probability density near the best action are reached and therefore the variance of chosen actions is lower than original. The influence of modifications is proved by simulation study describing learning and behavior of asynchronous electromotor scalar control. Standard PSD controller is used whose parameter values represent actions of three independent automata. The goal of on line learning process is to minimize the mean square of control error. Here described modifications of algorithm allow the improvement of quality of revolutions control with preserving basic algorithm characteristics.
[klicova_slova_en] => active magnetic bearing, control, CARLA
[vysledek_datum] => 2005-05-09T00:00:00+02:00
)
)
)
Array
(
[total] => 2086
[page] => 42
[count] => 9
[n_pages] => 140
[pagelen] => 15
[odkaz] => typVysledku=&rok=&ftext=&btnSubmit=1
[base_detail] => /en/veda/publikace/detail/
[base_page] => /en/veda/publikace
[vysledek] => Array
(
[0] => Array
(
[quotations] => LACKO, B.
[title] => Analýza komunikace výzkum - praxe
[typ] => PV
[year] => 2006
[id_vav] => 20274
)
[1] => Array
(
[quotations] => ŠEDA, M.
[title] => Mathematical Models and Representation Schemes of Manufacturing Processes
[typ] => PV
[year] => 2006
[id_vav] => 20351
)
[2] => Array
(
[quotations] => ŠEDA, M.
[title] => Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems
[typ] => PV
[year] => 2006
[id_vav] => 20352
)
[3] => Array
(
[quotations] => ŠEDA, M.
[title] => Relaxation of Roadmap Methods of Robot Motion Planning
[typ] => PV
[year] => 2006
[id_vav] => 20353
)
[4] => Array
(
[quotations] => ŠEDA, M.
[title] => Solving Fuzzy Network Optimisation Problems
[typ] => PV
[year] => 2006
[id_vav] => 20354
)
[5] => Array
(
[quotations] => VRBKA, M.; VAVERKA, M.; POLIŠČUK, R.; KŘUPKA, I.; HARTL, M.; URBANEC, L.
[title] => Evaluation of pressure from film thickness within EHL contact with dented surfaces
[typ] => PV
[year] => 2006
[id_vav] => 20369
)
[6] => Array
(
[quotations] => ŠEDA, M.
[title] => Motion Planning in the Plane Using Voronoi Diagrams
[typ] => PV
[year] => 2005
[id_vav] => 20475
)
[7] => Array
(
[quotations] => Březina, T., Turek, M., Pulchart, J.
[title] => Self-learning Controller of Active Magnetic Bearing Based on CARLA method
[typ] => PV
[year] => 2005
[id_vav] => 20504
)
[8] => Array
(
[quotations] => Turek, M., Březina, T., Pulchart, J.
[title] => SOME NOTES ON CONTROL OF ASYNCHRONOUS ELECTROMOTOR BY IMPROVED CARLA METHOD
[typ] => PV
[year] => 2005
[id_vav] => 20505
)
)
)