Piotr Skrzypczyński

Piotr Skrzypczyński

orcid

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 January 2022 in Sensors
Verified
Journal Article
Open access
PDF file
Kamil RoszykKamil Roszyk
Kamil Roszyk
MNMichał Nowicki
Michał Nowicki
PSPiotr Skrzypczyński
Piotr Skrzypczyński
Detecting pedestrians in autonomous driving is a safety-critical task, and the decision to avoid a a person has to be made with minimal latency. Multispectral approaches that combine RGB and thermal images are researched extensively, as they make it possible to gain robustness under varying illumination and weather conditions. State-of-the-art solutions employing deep neural networks offer high accuracy of pedestrian detection. However, the literature is short of works that evaluate multispectral pedestrian detection with respect to its feasibility in obstacle avoidance scenarios, taking into account the motion of the vehicle. Therefore, we investigated the real-time neural network detector architecture You Only Look Once, the latest version (YOLOv4), and demonstrate that this detector can be adapted to multispectral pedestrian detection. It can achieve accuracy on par with the state-of-the-art while being highly computationally efficient, thereby supporting low-latency decision making. The results achieved on the KAIST dataset were evaluated from the perspective of automotive applications, where low latency and a low number of false negatives are critical parameters. The middle fusion approach to YOLOv4 in its Tiny variant achieved the best accuracy to computational efficiency trade-off among the evaluated architectures.

21 June 2011 in Journal of Field Robotics
Verified
Journal Article
Closed access
PDF file
DBDominik Belter
Dominik Belter
PSPiotr Skrzypczyński
Piotr Skrzypczyński

24 June 2015 in Journal of Field Robotics
Verified
Journal Article
Closed access
PDF file
DBDominik Belter
Dominik Belter
PŁPrzemysław Łabęcki
Przemysław Łabęcki
PSPiotr Skrzypczyński
Piotr Skrzypczyński

22 May 2018 in Journal of Intelligent & Robotic Systems
Verified
Journal Article
Open access
PDF file
DBDominik Belter
Dominik Belter
JWJan Wietrzykowski
Jan Wietrzykowski
PSPiotr Skrzypczyński
Piotr Skrzypczyński
This paper considers motion planning for a six-legged walking robot in rough terrain, considering both the geometry of the terrain and its semantic labeling. The semantic labels allow the robot to distinguish between different types of surfaces it can walk on, and identify areas that cannot be negotiated due to their physical nature. The proposed environment map provides to the planner information about the shape of the terrain, and the terrain class labels. Such labels as “wall” and “plant” denote areas that have to be avoided, whereas other labels, “grass”, “sand”, “concrete”, etc. represent negotiable areas of different properties. We test popular classification algorithms: Support Vector Machine and Random Trees in the task of producing proper terrain labeling from RGB-D data acquired by the robot. The motion planner uses the A∗ algorithm to guide the RRT-Connect method, which yields detailed motion plans for the multi-d.o.f. legged robot. As the A∗ planner takes into account the terrain semantic labels, the robot avoids areas which are potentially risky and chooses paths crossing mostly the preferred terrain types. We report experimental results that show the ability of the new approach to avoid areas that are considered risky for legged locomotion.

23 October 2023 in IEEE Transactions on Robotics
Verified
Journal Article
Open access
PKPiotr Kicki
Piotr Kicki
PLPuze Liu
Puze Liu
DTDavide Tateo
Davide Tateo
HBHaitham Bou-Ammar
Haitham Bou-Ammar
KWKrzysztof Walas
Krzysztof Walas
Jan PetersJan Peters
Jan Peters
Motion planning is a mature area of research in robotics with many well-established methods based on optimization or sampling the state space, suitable for solving kinematic motion planning. However, when dynamic motions under constraints are needed and computation time is limited, fast kinodynamic planning on the constraint manifold is indispensable. In recent years, learning-based solutions have become alternatives to classical approaches, but they still lack comprehensive handling of complex constraints, such as planning on a lower dimensional manifold of the task space while considering the robot's dynamics. This article introduces a novel learning-to-plan framework that exploits the concept of constraint manifold, including dynamics, and neural planning methods. Our approach generates plans satisfying an arbitrary set of constraints and computes them in a short constant time, namely the inference time of a neural network. This allows the robot to plan and replan reactively, making our approach suitable for dynamic environments. We validate our approach on two simulated tasks and in a demanding real-world scenario, where we use a Kuka LBR Iiwa 14 robotic arm to perform the hitting movement in robotic air hockey.

1 December 2009 in International Journal of Applied Mathematics and Computer Science
Verified
Journal Article
Open access
PDF file
PSPiotr Skrzypczyński
Piotr Skrzypczyński
Simultaneous localization and mapping: A feature-based probabilistic approach: This article provides an introduction to Simultaneous Localization And Mapping (SLAM), with the focus on probabilistic SLAM utilizing a feature-based description of the environment. A probabilistic formulation of the SLAM problem is introduced, and a solution based on the Extended Kalman Filter (EKF-SLAM) is shown. Important issues of convergence, consistency, observability, data association and scaling in EKF-SLAM are discussed from both theoretical and practical points of view. Major extensions to the basic EKF-SLAM method and some recent advances in SLAM are also presented.